2-State 3-Symbol Universal Turing Machines Do Not Exist
Other Computer Science
2011-12-12 v5
Abstract
In this brief note, we give a simple information-theoretic proof that 2-state 3-symbol universal Turing machines cannot possibly exist, unless one loosens the definition of "universal".
Cite
@article{arxiv.0706.4440,
title = {2-State 3-Symbol Universal Turing Machines Do Not Exist},
author = {Craig Alan Feinstein},
journal= {arXiv preprint arXiv:0706.4440},
year = {2011}
}