Small universal Turing machines
Theoretical Computer Science - Special issue on universal machines and computations
A new kind of science
The busy beaver, the placid platypus and other crazy creatures
CATS '06 Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51
Languages and Machines: An Introduction to the Theory of Computer Science (3rd Edition)
Languages and Machines: An Introduction to the Theory of Computer Science (3rd Edition)
Back to the Complexity of Universal Programs
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
The complexity of small universal Turing machines: A survey
Theoretical Computer Science
Four small universal turing machines
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Simplicity via provability for universal prefix-free Turing machines
Theoretical Computer Science
On the complexity of universal programs
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
| Hi-index | 0.00 |
Universal Turing machines are a well-known concept in computer science. Most often, universal Turing machines are constructed by humans, and designed with particular features in mind. This is especially true of recent efforts to find small universal Turing machines, as these are often the product of sophisticated human reasoning. In this paper we take a different approach, in that we investigate how we can search through a number of Turing machines and recognise universal ones. This means that we have to examine very carefully the concepts involved, including the notion of what it means for a Turing machine to be universal, and what implications there are for the way that Turing machines are coded as input strings.