Are There New Models of Computation? Reply to Wegner and Eberbach †

Abstract

Wegner and Eberbach[Weg04b] have argued that there are fundamental limitations
\nto Turing Machines as a foundation of computability and that these can be overcome
\nby so-called superTuring models such as interaction machines, the [pi]calculus and the
\n$-calculus. In this paper we contest Weger and Eberbach claims.