The proof of Magic's Turing completeness is one of the coolest ideas out there, at least for me as someone with computer science background.
I still find the solution presented by Alex super cryptic, though. The construction Universal Turing Machine using obscure Magic interactions is really something of a dark magic. I can't think of a simpler way though, considering TS needs a tape which preserves order (which is a property no zones but GY and the library have, and those are finite), so the only solution is the board, which is only infinite if you use tokens for cells. And then to address the tokens and to store data in them...impressive stuff.
Rise and Fall - Ancient history themed custom Magic set (early design stage). Dual lands cheat sheet - Last updated on September 14 2014 (updated for Khans, updated card prices) GauntletPrinter - New tool to print multiple decks on a single deck of proxies