加载中…
2007-06-29
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”.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本