Skip to main content
SpringerLink
Log in

Teaching theory of computation with tape machines

  • Contributed Papers
  • Conference paper
  • First Online:
Automata Implementation (WIA 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1436))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barwise, J., J. Etchemendy: Turing,s World, Intellimation Library for Macintosh, P.O.Box 1530, Santa Barabara, CA 93116-1530

    Google Scholar 

  2. Brady, J. M.: A Programming Approach to Some Concepts and Results in the Theory of Computation, The Computer Journal V19 N3 (1974)

    Google Scholar 

  3. Cutland, N.:Computability.An introduction to recursive function theory.Cambridge Univerrsity Press (1980)

    Google Scholar 

  4. Hermes, H.: Enumerability, Decidability, Computability. Springer (1965)

    Google Scholar 

  5. Minsky, M.: Computation: Finite and Infinite Machines. Prentice-Hall (1967)

    Google Scholar 

  6. Shepherdson, J. C., Sturgis, H. E.: Computability of Recursive Functions. JACM Vol.10 (1963) 217–255

    Google Scholar 

  7. Turing, A.: On Computable Numbers With an Application to the Entscheidungsproblem. Proc. London Math. Soc. Ser.2 42 (1936)

    Google Scholar 

  8. Wang Hao: A variant to Turing's Theory of Computing Machines. JACM 4 1 (1957)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Natal, Pietermaritzburg

    Y. Velinov

Authors
  1. Y. Velinov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Derick Wood Sheng Yu

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation