A simplified universal Turing machine

Authors:
E. F. Moore
Affiliations:
-
Venue:
ACM '52 Proceedings of the 1952 ACM national meeting (Toronto)
Year:
1952

Citing 0
Cited 5

A Variant to Turing's Theory of Computing Machines

Journal of the ACM (JACM)
Specification languages for mechanical languages and their processors a baker's dozen: a set of examples presented to ASA x3.4 subcommittee

Communications of the ACM
The complexity of small universal Turing machines: A survey

Theoretical Computer Science
The complexity of small universal turing machines: a survey

SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Towards methods for discovering universal Turing machines (or how universal unicorns can be discovered, not created)

CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119

Quantified Score

Hi-index	0.02

Visualization

Abstract

In 1936 Turing (1) defined a class of logical machines (which he called a - machines, but which are now generally called Turing machines) which he used as an aid in proving certain results in mathematical logic, and which should prove of interest in connection with the theory of control and switching systems. Given any logical operation or arithmetical computation for which complete instructions for carrying out can be supplied, it is possible to design a Turing machine which can perform this operation.