With regards to computational complexity, a multi-tape wide-spread Turing machine have to have more slowly by logarithmic factor when compared to machines it simulates. Universal Turing machine is often a Turing machine that can simulate an haphazard Turing machine with arbitrary input. The universal machine essentially achieves that by reading the description of machine to be simulated and also the input thereof from a unique tape.