34-byte Universal Machine
N. Megill writes: "Computer scientist and obfuscated code aficionado John Tromp has devised
what may be the world's
most compact Universal Machine (Postscript research paper)
to date. Written in the 'S-K combinatory logic' language, which has
only 2 commands (S and K), his UM can be encoded with only 272 bits
(34 bytes), compared to
5495 bits
for the Universal Turing Machine given
in Roger Penrose's book The Emperor's New
Mind ."
Imagine a Beowulf cluster of these things displaying a Natalie Portman montage.
Edith Keeler Must Die
Google has cached the page. Here is the HTML page. Here is the text version of the postscript paper.
A cached copy of the research paper is available in in several formats from citeseer.