  Turing showed that he could build a Turing machine, \(U\), that was universal, in the sense that it could run the program of any other Turing machine. More explicitly, for any \(i\), and any input \(w, U\) on inputs \(i\) and \(w\) would do exactly what \(M_{i}\) would do on input \(w\), in symbols,