Is Wolfram and Cook's (2,5) Turing machine really universal?
  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. 
Dominic J. D. Hughes
cs.FL cs.LO math.LO