2000 character limit reached
Is Wolfram and Cook's (2,5) Turing machine really universal?
Published 31 Aug 2012 in cs.FL, cs.LO, and math.LO | (1208.6342v1)
Abstract: Wolfram [2, p. 707] and Cook [1, p. 3] claim to prove that a (2,5) Turing machine (2 states, 5 symbols) is universal, via a universal cellular automaton known as Rule 110. The first part of this paper points out a critical gap in their argument. The second part bridges the gap, thereby giving what appears to be the first proof of universality.
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.
