Are There New Models of Computation? Reply to Wegner and Eberbach †
Paul W. Cockshott, Greg Michaelson · The Computer Journal · 2007
ABSTRACT. Wegner and Eberbach[Weg04b] have argued that there are fundamental lim-itations to Turing Machines as a foundation of computability and that these can be over-come by so-called superTuring models such as interaction machines, the picalculus and the $-calculus. In this paper we contest Weger and Eberbach claims. 1.