The same mental state or property could be implemented or realized by different states of a universal Turing machine.

The stored-program computer idea can be traced back to the 1936 theoretical concept of a universal Turing machine.

A universal Turing machine, is used for the computer operations.

The argument for functionalism is that the same mental state could be implemented by the different states of a universal Turing machine.

Rule 110 has been the basis over which some of the smallest universal Turing machines have been built.

Any such program can be realized on a universal Turing machine such as the familiar computer.

Alternatively, such a system is one that can simulate a universal Turing machine.

What the thesis actually says is that any mechanical procedure can be carried out by a universal Turing machine.

Moreover, a so-called universal Turing machine could emulate any other conceivable computer.

Those features would give us a universal Turing machine.