Universality of (p=2) Tag Systems and a 4 Symbol 7 State Universal Turing MachineDecember 1962
- Author:
- Marvin Minsky
Abstract
No abstract available.
Cited By
- Neary T and Woods D The complexity of small universal turing machines Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science, (385-405)
- Harland J Towards methods for discovering universal Turing machines (or how universal unicorns can be discovered, not created) Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119, (151-160)
- Harland J Towards methods for discovering universal Turing machines (or how universal unicorns can be discovered, not created) Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119, (151-160)
Recommendations
Sublogarithmic Space-Bounded Multi-Inkdot Alternating Turing Machines with Only Existential (Universal) States
This paper investigates the accepting powers of two-way alternating Turing machines (2ATM's) with only existential (universal) states which have inkdots and sublogarithmic space. It is shown that for sublogarithmic space-bounded computations, (i) multi-...
Understanding the Universal Turing Machine: an implementation in JFLAP
We describe the implementation of a Universal Turing Machine for the JFLAP platform. JFLAP is most successful and widely used tool for visualizing and simulating automata such as finite state machines, pushdown automata, and Turing Machines. By ...