A Universal Turing Machine, often abbreviated as UTM, will simulate any Turing Machine designed to perform a specific task. It does this by using as its input the information that describes the Turing Machine it is going to simulate. It then uses the input data that would have been fed into the original Turing Machine to perform the originally intended task. So, the UTM is, in fact, a programmable computer, where the program is the description of the Turing Machine for the specified task. It should, in theory, be able to simulate any modern computer.
Rendell persevered with his work and, ten years after he had invented the Game of Life’s first Turing Machine, he had upgraded it to a working UTM! The Game of Life UTM is not fast compared with, say, your laptop or the computer controlling your mobile phone – for instance, it takes 18,960 time-steps of the Game of Life to produce just one UTM computer cycle!