The Computer Journal Advance Access originally published online on February 1, 2007
The Computer Journal 2007 50(2):232-247; doi:10.1093/comjnl/bxl062
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Are There New Models of Computation? Reply to Wegner and Eberbach
1 Department of Computing Science, University of Glasgow 17 Lilybank Gds, Glasgow G12 8QQ, UK
2 School of Mathematical and Computer Sciences, Heriot-Watt University, Riccarton EH14 4AS, UK
* Corresponding author: g.michaelson{at}hw.ac.uk
Received 2 September 2005; revised 28 September 2006
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.
Key Words: Hyper-computation effective calculability computability