Affordable Access

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

Authors
Publisher
Oxford University Press
Publication Date
Keywords
  • Qa75 Electronic Computers. Computer Science
Disciplines
  • Mathematics

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.

There are no comments yet on this publication. Be the first to share your thoughts.