Skip to main content
Conference Proceedings

Constraints on hypercomputation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2006) 3988 LNCS 378-387
DOI: 10.1007/11780342_40
3Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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 π-calculus. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Michaelson, G., & Cockshott, P. (2006). Constraints on hypercomputation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3988 LNCS, pp. 378–387). Springer Verlag. https://doi.org/10.1007/11780342_40

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free