Topic summary

Universal Machine

Extracted from the Wikipedia article Universal Turing machine.

Common sense might say that a universal machine is impossible, but Turing proves that it is possible. He suggested that we may compare a human in the process of computing a real number to a machine that is only capable of a finite number of conditions ⁠ $q_{1},q_{2},\dots ,q_{R}$ ⁠; which will be called " $m$ -configurations". He then described the operation of such machine, as described below, and argued:

Wikipedia source