2-State 3-Symbol Universal Turing Machines Do Not Exist

Craig Alan Feinstein

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".

Knowledge Graph

arrow_drop_up

Comments

Sign up or login to leave a comment