A UNIVERSAL TURING MACHINE
A Universal Turing
Machine (UTM) is a logical procedure that can be coded as an algorithm in a
binary format. Such an algorithm embodies a universal
procedure that can mime all computable procedures. The operating systems of
general computers, includng PC's may viewed as UTM's. Viewing the code
for a UTM on a computer monitor may be likened to viewing a portrait of the
computer used for displaying the UTM. The version shown here was written by Steven Gunhouse.
He noted that this version is based on Fibonacci numbering to complement Alan Turing's interest in the Fibonacci sequence.
View a Universal
Turing Machine as a Self Portrait
UTM marquee may fail to
work on some browsers.
rationale, versions and sources.