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 such as interaction machines, the π-calculus and the $-calculus. In this paper we contest the Wegner and Eberbach claims
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.