Affiliation:
1. a.k.a. Karel Van Oudheusden, Department of Computer Science, Celestijnenlaan 200a, Box 2402, 3001 Leuven, Belgium
Abstract
The outputs of a Turing machine are not revealed for inputs on which the machine fails to halt. Why is an observer not allowed to see the generated output symbols as the machine operates? Building on the pioneering work of Mark Burgin, we introduce an extension of the Turing machine model with a visible output tape. As a subtle refinement to Burgin’s theory, we stipulate that the outputted symbols cannot be overwritten: at step i, the content of the output tape is a prefix of the content at step j, where i<j. Our Refined Burgin Machines (RBMs) compute more functions than Turing machines, but fewer than Burgin’s simple inductive Turing machines. We argue that RBMs more closely align with both human and electronic computers than Turing machines do. Consequently, RBMs challenge the dominance of Turing machines in computer science and beyond.
Reference36 articles.
1. Hopcroft, J., and Ullman, J. (1979). Introduction to Automata Theory, Languages, and Computation, Addison-Wesley.
2. On Computable Numbers, with an Application to the Entscheidungsproblem;Turing;Proc. Lond. Math. Soc.,1936
3. Weihrauch, K. (2000). Computable Analysis—An Introduction, Springer. Texts in Theoretical Computer Science.
4. Daylight, E. (2011). Pluralism in Software Engineering: Turing Award Winner Peter Naur Explains, Lonely Scholar.
5. Scheutz, M. (2002). The foundations of computing. Computationalism: New Directions, MIT Press.