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

Paul Cockshott, Greg Michaelson

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

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 p-calculus and the $-calculus. In this article, we contest the Wegner and Eberbach claims. © 2007 Oxford University Press.

Original languageEnglish
Pages (from-to)232-247
Number of pages16
JournalComputer Journal
Volume50
Issue number2
DOIs
Publication statusPublished - Mar 2007

Keywords

  • Computability
  • Effective calculability
  • Hyper-computation

Fingerprint Dive into the research topics of 'Are there new models of computation? Reply to Wegner and Eberbach'. Together they form a unique fingerprint.

  • Cite this