5 citations · 15 across the 11 of their papers we have counts for
1 paper · 2 filters
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 "univer…