Skip Navigation


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
This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
50/2/232    most recent
bxl062v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Cockshott, P.
Right arrow Articles by Michaelson, G.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2007. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

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

Paul Cockshott1 and Greg Michaelson2,*

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 {pi}-calculus and the $-calculus. In this article, we contest the Wegner and Eberbach claims.

Key Words: Hyper-computation • effective calculability • computability


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.