Constraints on hypercomputation

Greg Michaelson; Paul Cockshott

doi:10.1007/11780342_40

Constraints on hypercomputation

Greg Michaelson, Paul Cockshott

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

3 Citations (Scopus)

Abstract

Wegner and Eberbach[16] 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. In this paper we contest their claims for interaction machines and the p-calculus. © Springer-Verlag Berlin Heidelberg 2006.

Original language	English
Title of host publication	Logical Approaches to Computational Barriers - Second Conference on Computability in Europe, CiE 2006, Proceedings
Pages	378-387
Number of pages	10
Volume	3988 LNCS
DOIs	https://doi.org/10.1007/11780342_40
Publication status	Published - 2006
Event	2nd Conference on Computability in Europe - Swansea, United Kingdom Duration: 30 Jun 2006 → 5 Jul 2006

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	3988 LNCS
ISSN (Print)	0302-9743

Conference

Conference	2nd Conference on Computability in Europe
Abbreviated title	CiE 2006
Country/Territory	United Kingdom
City	Swansea
Period	30/06/06 → 5/07/06

Access to Document

10.1007/11780342_40

Cite this

Michaelson, G., & Cockshott, P. (2006). Constraints on hypercomputation. In Logical Approaches to Computational Barriers - Second Conference on Computability in Europe, CiE 2006, Proceedings (Vol. 3988 LNCS, pp. 378-387). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3988 LNCS). https://doi.org/10.1007/11780342_40

@inproceedings{00b6183faf944c8fbab1a9698c0bbfd8,

title = "Constraints on hypercomputation",

abstract = "Wegner and Eberbach[16] 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. In this paper we contest their claims for interaction machines and the p-calculus. {\textcopyright} Springer-Verlag Berlin Heidelberg 2006.",

author = "Greg Michaelson and Paul Cockshott",

year = "2006",

doi = "10.1007/11780342_40",

language = "English",

isbn = "3540354662",

volume = "3988 LNCS",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "378--387",

booktitle = "Logical Approaches to Computational Barriers - Second Conference on Computability in Europe, CiE 2006, Proceedings",

note = "2nd Conference on Computability in Europe, CiE 2006 ; Conference date: 30-06-2006 Through 05-07-2006",

}

Michaelson, G & Cockshott, P 2006, Constraints on hypercomputation. in Logical Approaches to Computational Barriers - Second Conference on Computability in Europe, CiE 2006, Proceedings. vol. 3988 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3988 LNCS, pp. 378-387, 2nd Conference on Computability in Europe, Swansea, United Kingdom, 30/06/06. https://doi.org/10.1007/11780342_40

Constraints on hypercomputation. / Michaelson, Greg; Cockshott, Paul.

Logical Approaches to Computational Barriers - Second Conference on Computability in Europe, CiE 2006, Proceedings. Vol. 3988 LNCS 2006. p. 378-387 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3988 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Constraints on hypercomputation

AU - Michaelson, Greg

AU - Cockshott, Paul

PY - 2006

Y1 - 2006

N2 - Wegner and Eberbach[16] 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. In this paper we contest their claims for interaction machines and the p-calculus. © Springer-Verlag Berlin Heidelberg 2006.

AB - Wegner and Eberbach[16] 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. In this paper we contest their claims for interaction machines and the p-calculus. © Springer-Verlag Berlin Heidelberg 2006.

UR - http://www.scopus.com/inward/record.url?scp=33746036859&partnerID=8YFLogxK

U2 - 10.1007/11780342_40

DO - 10.1007/11780342_40

M3 - Conference contribution

SN - 3540354662

SN - 9783540354666

VL - 3988 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 378

EP - 387

BT - Logical Approaches to Computational Barriers - Second Conference on Computability in Europe, CiE 2006, Proceedings

T2 - 2nd Conference on Computability in Europe

Y2 - 30 June 2006 through 5 July 2006

ER -

Michaelson G, Cockshott P. Constraints on hypercomputation. In Logical Approaches to Computational Barriers - Second Conference on Computability in Europe, CiE 2006, Proceedings. Vol. 3988 LNCS. 2006. p. 378-387. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/11780342_40

Constraints on hypercomputation

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this