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 ."
- Unsure what to make of this?
- Confused by S(SKK)(K(Sq(S(S(SKK)(KS))(KK))))?
- Interested in learning about S-K?
Then we can help you meet women just like you!Pushin' 'n dealin', shovin' 'n stealin'
Installing linux and making a beowulf cluster of them.
-1: stupid