Constraints on hypercomputation

Greg Michaelson, Paul Cockshott

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish
Title of host publicationLogical Approaches to Computational Barriers - Second Conference on Computability in Europe, CiE 2006, Proceedings
Pages378-387
Number of pages10
Volume3988 LNCS
DOIs
Publication statusPublished - 2006
Event2nd Conference on Computability in Europe - Swansea, United Kingdom
Duration: 30 Jun 20065 Jul 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3988 LNCS
ISSN (Print)0302-9743

Conference

Conference2nd Conference on Computability in Europe
Abbreviated titleCiE 2006
CountryUnited Kingdom
CitySwansea
Period30/06/065/07/06

Fingerprint Dive into the research topics of 'Constraints on hypercomputation'. Together they form a unique fingerprint.

  • 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