Skip to main content
Article thumbnail
Location of Repository

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

By Paul Cockshott and Greg Michaelson

Abstract

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 π-calculus and the $-calculus. In this paper we contest the Wegner and Eberbach claims

Year: 2005
OAI identifier: oai:CiteSeerX.psu:10.1.1.415.7372
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://research.cs.queensu.ca/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.