Abstract
The purpose of this paper is to outline an approach for the development of the Tape Machine model in Theory of Computation which is linked more closely to the real computer world. The approach is based on a developed software package consisting of a Tape Machine Simulator, a Tape Machine Assembler and a Register Machine Simulator. Using the software and the ideas underlying it the aims of the theory can be achieved without any loss of mathematical rigor but in a more natural, useful and attractive manner.
Preview
Unable to display preview. Download preview PDF.
References
Barwise, J., J. Etchemendy: Turing,s World, Intellimation Library for Macintosh, P.O.Box 1530, Santa Barabara, CA 93116-1530
Brady, J. M.: A Programming Approach to Some Concepts and Results in the Theory of Computation, The Computer Journal V19 N3 (1974)
Cutland, N.:Computability.An introduction to recursive function theory.Cambridge Univerrsity Press (1980)
Hermes, H.: Enumerability, Decidability, Computability. Springer (1965)
Minsky, M.: Computation: Finite and Infinite Machines. Prentice-Hall (1967)
Shepherdson, J. C., Sturgis, H. E.: Computability of Recursive Functions. JACM Vol.10 (1963) 217–255
Turing, A.: On Computable Numbers With an Application to the Entscheidungsproblem. Proc. London Math. Soc. Ser.2 42 (1936)
Wang Hao: A variant to Turing's Theory of Computing Machines. JACM 4 1 (1957)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Velinov, Y. (1998). Teaching theory of computation with tape machines. In: Wood, D., Yu, S. (eds) Automata Implementation. WIA 1997. Lecture Notes in Computer Science, vol 1436. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0031394
Download citation
DOI: https://doi.org/10.1007/BFb0031394
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64694-5
Online ISBN: 978-3-540-69104-4
eBook Packages: Springer Book Archive