 Smith then showed that even though the initial condition of the (2,3) Turing machine is not repetitive, the construction of that initial condition is not universal.Hence the (2,3) Turing machine is universal.Wolfram claims that Smith's proof is another piece of evidence for Wolfram's general "Principle of Computational Equivalence" (PCE).