Are There New Models of Computation? Reply to Wegner and Eberbach

Authors:
Paul Cockshott;Greg Michaelson
Affiliations:
Department of Computing Science, University of Glasgow 17 Lilybank Gds, Glasgow G12 8QQ, UK;School of Mathematical and Computer Sciences, Heriot-Watt University, Riccarton EH14 4AS, UK
Venue:
The Computer Journal
Year:
2007

Citing 0
Cited 2

Physical constraints on hypercomputation

Theoretical Computer Science
Non-classical computing: feasible versus infeasible

Proceedings of the 2010 ACM-BCS Visions of Computer Science Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

Wegner and Eberbach have argued that there are fundamental limitations to Turing Machines as a foundation of computability and that these can be overcome by so-called super-Turing models such as interaction machines, the π-calculus and the $-calculus. In this article, we contest the Wegner and Eberbach claims.