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

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 super-Turing models such as interaction machines, the π-calculus and the $-calculus. In this article, we contest the Wegner and Eberbach claims.