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

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

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)