2000 character limit reached
2-State 3-Symbol Universal Turing Machines Do Not Exist (0706.4440v5)
Published 29 Jun 2007 in cs.OH
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".