Turing’s simple imaginary machine is an elegant mathematical proof for universal computation, but it is also an ur-algorithm, an abstraction generator. The mathematical equivalence of Church and Turing’s work quickly suggested that varying proofs of effective computability (there are now over thirty) all gesture toward some fundamental universal truth.
