Path: Home | CS

It is possible to invent a single machine which

can be used to compute computable sequence.

If this machine U is supplied with a tape

on the beginning of which is written

the S.D ["standard description" of an action table]

of some computing machine M, then U will compute

the same sequence as M.

- Description of what's now UTM by Alan Turing in his 1936 paper.