2-State 3-Symbol Universal Turing Machines Do Not Exist
published by Craig Alan Feinstein
in 2011
in Informatics Engineering
and research's language is
English
Download
Abstract in English
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.