Universal machine

Updated: 04/26/2017 by Computer Hope

A universal machine, also known as a universal Turing machine or UTM, is a Turing machine capable of simulating any other Turing machine. It was defined mathematically by Alonzo Church, who also invented the Lambda calculus. Church's work, combined with Turing's, created a formal theory of computation known as the Church-Turing thesis.

Computer acronyms, Hardware terms