Abstract
Turing machines were devised by Alan Turing in 1936 in a paper [12] which lays the foundations of computer science. In this paper, Alan Turing proposes a model of computation. The notion was very new at that time. It is remarkable that the editors of Proceedings of the London Mathematical Society who published the paper fully understood this point and, as a consequence, they created a new section in the classification of the issue where this paper was published.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baiocchi C., Three small universal Turing machines, Lecture Notes in Computer Science, 2055, Proceedings of MCU’2001, Chi§inäu, Moldova, May, 2001, M. Margenstern and Y. Rogozhin editors, 1–10, (2001).
Kleene S.C., Introduction to Metamathematics, North Holland, Amsterdam, (1952).
Kleene S.C., A note on recursive functions, Bulletin of the American Mathematical Society,42 (1936), 544bis–546.
Kudlek M., Rogozhin Yu., A universal Turing machine with 3 states and 9 symbols, Lecture Notes in Computer Science, 2295 (2002), 311–318.
Margenstern M., Frontier between decidability and undecidability a survey, Theoretical Computer Science, 231–2 (2000), 217–251.
Margenstern M., Pavlotskaya L., On the optimal number of instructions for universal Turing machines connected with a finite automaton, International Journal of Algebra and Computation, 13, 2 (2003), 133–202.
Minsky M.L., Computation: Finite and Infinite Machines, Prentice Hall, Englewood Cliffs, N.J., (1967).
Odifreddi P., Classical Recursion Theory, North Holland, Amsterdam, (1989).
Rogozhin Yu., Seven universal Turing machines, Matematicheskie Issledovanija, 69 (1982), 76–90 (in Russian).
Rogozhin Yu., Small universal Turing machines, Theoretical Computer Science,168-2 (1996), 215–240.
Shannon C., A universal Turing machine with two internal states, Automata studies, Annals of Mathematical Studies, 34 (1956), 157–165.
Turing A.M., On computable real numbers, with an application to the Entscheidungsproblem, Proceedings of the London Mathematical Society, ser. 2, 42 (1936), 230–265.
Wang Hao, A variant to Turing’s theory of computing machines, Journal of the Association for Computing Machinery, 4 (1957), 63–92.
Wang Hao, Tag systems and lag systems, Mathematische Annalen, 152 (1963), 65–74.
Watanabe S., 5-symbol and 8-state and 8-symbol and 6-state universal Turing machines, Journal of the Association for Computing Machinery, 8 (1961), 476–483.
Zykin G.P., Remark on a theorem of Hao Wang, Algebra i Logika, 2, 1 (1963), 33–35 (in Russian).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Margenstern, M. (2004). Turing Machines: Universality and Limits of Computational Power. In: Martín-Vide, C., Mitrana, V., Păun, G. (eds) Formal Languages and Applications. Studies in Fuzziness and Soft Computing, vol 148. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39886-8_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-39886-8_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-53554-3
Online ISBN: 978-3-540-39886-8
eBook Packages: Springer Book Archive