The owner of this deck hasn't added a sideboard, they probably should...
Start typing a card name and use the auto-complete feature to quickly select the card you're trying to add. Enter a quantity and add that card to your sideboard!
Submit a list of cards below to bulk import them all into your sideboard. Post one card per line using a format like "4x Birds of Paradise" or "1 Blaze", you can even enter just the card name by itself like "Wrath of God" for single cards.
This is a deck that can create a Turing Machine out of Magic the Gathering. Theoretically with this deck, one could setup a game state in which it becomes possible to compute ANY computable problem in finite time. The game state, once set up, is one such that play continues effectively autonomously, following a program set up in the game state, until a point which the Turing Machine Halts, in which case, the executing player wins the game. The final observed game state may then be interpreted as the result of the program.Please read the following paper to learn more: https://arxiv.org/pdf/1904.09828.pdfThis deck Should not be taken as a serious Legacy Tournament Deck. It requires a perfect opening hand to execute, as well as an extended period of time to execute the entirety of the program. If the program is not set up such that the turing machine would eventually halt, then the game enters an infinite sequence of mandatory actions and therefore becomes a draw by 104.4b of the Magic Comprehensive Rules (But note that the halting problem applies).
Please read the following paper to learn more: https://arxiv.org/pdf/1904.09828.pdf
This deck has been viewed 372 times.
NOTE: Set by owner when deck was made.