The Universal Machine
The Universal Machine, proposed by the mathematician Alan Turing, is a theoretical device underpinning the idea of a general-purpose digital computer.
It emerged from Turing’s 1936 response to the then unsolved Hilbert’s problem – the Entscheidungsproblem – concerning whether mathematics was “decidable” which, in this context, referred to ‘the quality of being fixed in advance, in such a way that nothing new could arise’ (Hodges, 1983: 123).
To approach the problem of decidability, Turing abstracted the quality of being determined and applied it to the manipulation of symbols. Could we, he asked, imagine an automatic machine which would employ a mechanical process involving symbols to read a ‘mathematical assertion presented to it, and eventually writ[e] a verdict as to whether it was provable or not’?
By devising a novel formulation of the old concept of “algorithm”, Turing’s computational thought experiment showed that ‘there was no “miraculous machine” that could solve all mathematical problems’, and therefore the answer to Hilbert’s question was ‘no’ (Hodges, 1983: 124). Yet the dramatic potential remained for a Universal Machine that, through its algorithmic programming, was capable of simulating the actions of any other machine.
Today the logics of the Turing machine have been actualised in computing technology, the internet, and a wide range of computational architectures. At the time, however, the universal machine was not a tangible electronic device, but rather a speculative machine; a mathematical description of a possible future automated technology (Pedwell, 2022).