Computability in Europe 2006
Logical Approaches to Computational Barriers


Regular Talk:
Constraints on hypercomputation


Author(s): Greg Michaelson and Paul Cockshott
Slot: Array, 11:10-11:30, col. 3

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 superTuring models. In this
paper we contest their claims for interaction machines and the pi-calculus.


websites: Arnold Beckmann 2006-04-19