 Even though the machine has a head with only two states, and a tape that can hold only three colors (depending on the initial content of the tape), the machine's output can still be remarkably complex.On 24 October 2007, it was announced by Wolfram Research that Alex Smith, a student in electronics and computing at the University of Birmingham (UK), proved that the (2,3) Turing machine is universal and thus won Wolfram's prize described above.The proof showed that the machine is equivalent to a variant of a tag system already known to be universal.