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

Paul Cockshott; Greg Michaelson

doi:10.1093/comjnl/bxl062

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

Paul Cockshott, Greg Michaelson

Research output: Contribution to journal › Article › peer-review

17 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 language	English
Pages (from-to)	232-247
Number of pages	16
Journal	Computer Journal
Volume	50
Issue number	2
DOIs	https://doi.org/10.1093/comjnl/bxl062
Publication status	Published - Mar 2007

Keywords

Computability
Effective calculability
Hyper-computation

Access to Document

10.1093/comjnl/bxl062

Cite this

@article{4053f35c7a7e40d888aa5f5f6ccea1ab,

title = "Are there new models of computation? Reply to Wegner and Eberbach",

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. {\textcopyright} 2007 Oxford University Press.",

keywords = "Computability, Effective calculability, Hyper-computation",

author = "Paul Cockshott and Greg Michaelson",

year = "2007",

month = mar,

doi = "10.1093/comjnl/bxl062",

language = "English",

volume = "50",

pages = "232--247",

journal = "Computer Journal",

issn = "0010-4620",

publisher = "Oxford University Press",

number = "2",

}

TY - JOUR

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

AU - Cockshott, Paul

AU - Michaelson, Greg

PY - 2007/3

Y1 - 2007/3

N2 - 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.

AB - 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.

KW - Computability

KW - Effective calculability

KW - Hyper-computation

UR - https://www.scopus.com/pages/publications/33947204662

U2 - 10.1093/comjnl/bxl062

DO - 10.1093/comjnl/bxl062

M3 - Article

SN - 0010-4620

VL - 50

SP - 232

EP - 247

JO - Computer Journal

JF - Computer Journal

IS - 2

ER -

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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this