His name is Damian :-) — Damian Conway. But he's not the Conway from Conway's Game of Life.
The thought that Life can be used to run a turing machine isn't too surprising btw — they're both cellular automata, and just about anything you can do with one of those can be emulated with the aid of another.
If that blows your mind, try reading the proof that Minesweeper is NP-complete.
Makeshifts last the longest.
In reply to Re^6: modules = minilanguages?
by Aristotle
in thread modules = minilanguages?
by Anonymous Monk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |