2000 character limit reached
2-State 3-Symbol Universal Turing Machines Do Not Exist
Published 29 Jun 2007 in cs.OH | (0706.4440v5)
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".
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.