×

On the notion of universality of Turing machine. (English) Zbl 0167.01504


PDFBibTeX XMLCite
Full Text: EuDML

References:

[1] A. M. Turing: On Computable Numbers. Proc. London Math. Soc. 42 (1936). · Zbl 0016.09701 · doi:10.1112/plms/s2-42.1.230
[2] C. E. Shannon: A Universal Machine with Two Internal States. Automata Studies. Princeton 1956.
[3] M. A. Minsky: A \(6\)-symbol \(7\)-state Universal Turing Machine. MIT Lincoln Laboratory Report G-0027 (1960).
[4] P. C. Fisher: On Formalisms for Turing Machines. Journ. ACM 12 (1965). · Zbl 0154.41606
[5] S. Watanabe: A \(7\)-state \(3\)-symbol Universal Turing Machine. Mimeographed, 1967.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.