In 2007 it was proven that Wolfram's two state, three symbol Turing machine was universal, i.e. that it could compute anything that can be computed. Is there a similarly universal three state, two symbol universal Turing machine out there?

Upvotes: 1