Are there new models of computation? Reply to Wegner and Eberbach

Cockshott, W.P. and Michaelson, G. (2007) Are there new models of computation? Reply to Wegner and Eberbach. Computer Journal, 50(2), pp. 232-247. (doi: 10.1093/comjnl/bxl062)

Abstract

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

• Item Type: Articles
• Keywords: Hyper-computation, computability , effective calculability
• Status: Published
• Refereed: No
• Glasgow Author(s) Enlighten ID: Cockshott, Dr William
• Authors: Cockshott, W.P., and Michaelson, G.
• Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
• College/School: College of Science and Engineering > School of Computing Science
• Journal Name: Computer Journal
• Publisher: Oxford University Press
• ISSN: 0010-4620
• Copyright Holders: Copyright © 2007 Oxford University Press
• First Published: First published in the Computer Journal 50(2):232-247
• Publisher Policy: Reproduced in accordance with the copyright policy of the publisher