A UNIVERSAL TURING MACHINE
A Universal Turing
Machine (UTM) is a logical procedure that can be written in
algorithmic formats. Such an algorithm embodies the
universal function that can calculate any other computable
function. The operating systems of general computers, includng PC's
and smart phones, may viewed as UTM's. Viewing the code
for a UTM may be likened to viewing a self portrait of the machine displaying it. The version shown here,
based on Fibonacci numbering, was written by Steven Gunhouse to complement Alan Turing's interest in the Fibonacci sequence.
View a Universal
Turing Machine as a Self Portrait
UTM marquee works with
Explorer & Firefox.
It may not
work on some other browsers.
rationale, versions and sources.