Turing Machines (in "Turing's World")
Machines Related to Busy Beaver Competitions, Spring '95, '96:
The Right 5-loop Left 2-loop Machine
establishing that p(8) \ge 86, Spring 1996. Shown immediately below.
p(7) \ge 32,
by the "Sharp Group"
John Kozura, Jason Rennie), Spring 1995.
a machine by Damien Neil establishing that p(7) \ge 32, Spring 1995.
[p(6) \ge 13.]
Gordon Greene (Rensslear student) destroys Greg's Challenge,
Spring 1994 [p(6) \ge 19.]
Chris Nielsen's machine showing p(6) \ge 21; picture of flow graph shown.
Here are two machines which automatically convert TMs in the 5-tuple format into machines in the 4-tuple format used in Turing's World and Boolos and Jeffrey's book. Thanks to the "Grad Group," Spring 1994. Special thanks are due to Kari Coleman.
What Set of Infinite Strings Does this Buchi Automata Define?
The Factorial Machine
Minsky's small UTM (quintuple format)
(Taken from John Haugeland's
Artificial Intelligence: The Very Idea
, p. 139.)
Nondeterministic Machines Accepting Composite Numbers. (To view the problem that gave rise to these machines, click
The 3 Dumbasses
The Anonymous Group
The Nonexistent Group
The Unknown Group
The A & Not-A Group
Top Level of Bringsjord's Web Site