Universal Turing machine

Type of Turing machine

In computer science, a universal Turing machine (UTM) is a Turing machine capable of computing any computable sequence, as described by Alan Turing in his seminal paper "On Computable Numbers, with an Application to the Entscheidungsproblem". Common sense might say that a universal machine is impossible, but Turing proves that it is possible. He suggested that we may compare a man in the process of computing a real number to a machine which is only capable of a finite number of conditions ⁠⁠; which will be called "m-configurations". He then described the operation of such machine, as described below, and argued:It is my contention that these operations include all those which are used in the computation of a number.

This keyword could refer to multiple things. Here are some suggestions: