Constraints on Hypercomputation

Wegner and Eberbach[Weg04b] 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.

• Type: Conference
• Year: 2006
• Where: CIE
• Authors: Greg Michaelson, W. Paul Cockshott
• Keywords: Applied Computing, CIE 2006, Fundamental Limitations, So-called SuperTuring Models, Turing Machines