Papers of the day   All papers

Magic: The Gathering is Turing Complete

Comments

algoritmic: Magic: The Gathering is Turing Complete https://arxiv.org/pdf/1904.09828.pdf https://t.co/tAVsg1eahW

4 replies, 129 likes


Riccardo Spagni: RIP Ethereum Source: https://arxiv.org/abs/1904.09828 h/t smooth https://t.co/fGMoWQmj6W

9 replies, 92 likes


Hacker News: Magic: The Gathering is Turing Complete https://arxiv.org/abs/1904.09828

2 replies, 53 likes


Maximilian: Wanted to work on my NeurIPS submission but then I got distracted by someone building a Turing Machine in MagicTG (https://arxiv.org/pdf/1904.09828.pdf). I needed to tell someone about this and I don't think my gf knows the game, so here you go Twitter :D.

2 replies, 39 likes


Steve Patterson: Is Bitcoin Turing complete? Well, it turns out that Magic: The Gathering is... https://arxiv.org/abs/1904.09828 Thanks to @DanielKrawisz for the lead.

4 replies, 30 likes


Ethan Mollick: This might be the single nerdiest paper ever written (this is a compliment): proof that Magic the Gathering is Turing complete, and therefore you can theoretically use MtG decks as general purpose computers solve any algorithmic problems. https://arxiv.org/pdf/1904.09828.pdf https://t.co/modKG6qu2p

1 replies, 23 likes


Mithost: fucking excuse me https://arxiv.org/abs/1904.09828 https://t.co/QeoPmZM8zL

2 replies, 16 likes


slicedlime: This is brilliant. https://arxiv.org/abs/1904.09828

1 replies, 13 likes


Balpha: https://arxiv.org/abs/1904.09828 Okay, I love this paper.

2 replies, 13 likes


Ethan Mollick: Systems that are Turing-complete can do anything that any general purpose computer can do, including read and write data, perform math, and run programs. Here are some unexpectedly Turing-complete systems: 1) Magic the Gathering (or as @Justin_Gary calls it, bridge with elves) https://t.co/2nqJGletJf

1 replies, 12 likes


Frank Lantz: Very interesting paper about the computational complexity of Magic. https://arxiv.org/abs/1904.09828 https://t.co/v2Qai91rbN

0 replies, 12 likes


Ryan Calo: Magic the Gathering is Turing Complete. https://arxiv.org/abs/1904.09828 Thank you @JenLucPiquant for writing this up. Made my day and it's only 7:21am.

1 replies, 11 likes


Arrigo Triulzi: A. Churchill et al., “Magic: The Gathering is Turing Complete” [… In this paper we show that optimal play in real-world Magic is at least as hard as the Halting Problem, solving a problem that has been open for a decade… ] https://arxiv.org/abs/1904.09828

0 replies, 10 likes


Josh Baron: Ever wanted to embed an arbitrary Turing machine into a game of Magic: The Gathering? If so, read this paper, where we learn that the game is Turing Complete. The paper gives an explicit embedding of a Turing Machine into cards https://arxiv.org/abs/1904.09828

2 replies, 9 likes


Elissa: I was today years old when I learned that there was a paper written about the bizarre fact that Magic: The Gathering, the incredibly popular customisable card game, is actually TURING COMPLETE. https://arxiv.org/abs/1904.09828

1 replies, 8 likes


Sebastian Bergmann: TIL: "Magic: The Gathering" is Turing Complete. https://arxiv.org/abs/1904.09828

1 replies, 7 likes


Ethan Mollick: Magic the Gathering is a very complex game (as @Justin_Gary once described: "bridge with elves") that can replicate other games. In fact, you can use it to build a Turing Machine that can work as a general purpose computer to solve any algorithmic problem. https://arxiv.org/pdf/1904.09828.pdf https://t.co/V8kmvA61Bc

0 replies, 7 likes


Stella Rose: It’s frustrating to see so many articles about the #MagicTM paper that incorrectly describe it as AI research. On the other hand, you know what they say: any sufficiently advanced Magic is indistinguishable from AI! https://arxiv.org/abs/1904.09828

0 replies, 7 likes


Algoritmia básica: “This is the first result showing that there exists a real-world game for which determining the winning strategy is non-computable”.

1 replies, 6 likes


Trishank Karthik Kuppusamy: @interpretantion @ryankon @RubenGao @MatiosTV @paulportesi @aarongreen WOLFRAM LIKE SAID, UNIVERSALITY UBIQUITY EXPLANATION NEEDED https://arxiv.org/abs/1904.09828

0 replies, 6 likes


Graham Lee: A fun paper if you are a Magic player: https://arxiv.org/abs/1904.09828

1 replies, 5 likes


monae: Magic: The Gathering is Turing Complete https://arxiv.org/abs/1904.09828

0 replies, 5 likes


Florian Gilcher ∠(・.-)―〉 →◎: Also, reminder that Magic: The Gathering is turing complete: https://arxiv.org/abs/1904.09828

1 replies, 5 likes


Derrick Stolee: "Magic: the Gathering" is Turing complete. https://arxiv.org/abs/1904.09828

2 replies, 4 likes


Jesse Burneko: Magic: The Gathering is Turing Complete. That means you can build fully functional computers from Magic: The Gathering. https://arxiv.org/abs/1904.09828

1 replies, 4 likes


Urchin Colley: A Turing Machine encoded in a game of Magic. I can die happy now 😍 https://www.youtube.com/watch?v=pdmODVYPDLA (This is an accessible overview of the ideas in this paper https://arxiv.org/abs/1904.09828)

0 replies, 4 likes


☭hire the wayward child ☭: https://www.toothycat.net/~hologram/Turing/HowItWorks.html https://arxiv.org/abs/1904.09828

3 replies, 4 likes


Gro-Tsen: When I was younger, we were excited to learn that Sokoban was PSPACE-hard. It's nice to know that research has progressed in exciting new directions. 😄

0 replies, 3 likes


Wiskerz: There's a video but obviously the PDF is wild "Magic: The Gathering is Turing Complete" https://arxiv.org/abs/1904.09828 Video for non technical: https://www.youtube.com/watch?v=pdmODVYPDLA https://t.co/P7K3Q5u5pa

1 replies, 3 likes


Gustavo V. Barroso: Magic: The Gathering is Turing complete https://arxiv.org/abs/1904.09828

2 replies, 3 likes


Zoë Stephenson: @valthonis https://arxiv.org/abs/1904.09828

0 replies, 2 likes


Colin Sullender: This is the arXiv content I yearn for: Magic the Gathering is Turing complete. https://arxiv.org/abs/1904.09828

0 replies, 2 likes


Eugene Fischer: This paper is bonkers. I love it. Read the abstract. Magic: The Gathering is Turing complete: https://arxiv.org/abs/1904.09828

0 replies, 2 likes


Ioannis Xenarios: for a player like me fun to read a science article on one of the game i played https://arxiv.org/abs/1904.09828 quite a bit since 1993- this game is Turing complete

0 replies, 2 likes


Tom Rivlin: It's a good day today for scientific papers about games of various sorts https://arxiv.org/pdf/1904.09828.pdf https://t.co/aMvh0ToziP

0 replies, 2 likes


Mike Beckers: 🤔 Magic: The Gathering is Turing Complete 🤔 "we present a methodology for embedding an arbitrary Turing machine into a game of Magic such that the first player is guaranteed to win the game if and only if the Turing machine halts" https://arxiv.org/abs/1904.09828

0 replies, 2 likes


cryptopotato: big development https://arxiv.org/abs/1904.09828

0 replies, 2 likes


Benjamin Pope: Magic: The Gathering is Turing Complete, and optimal play in real-world Magic is at least as hard as the Halting Problem.

1 replies, 2 likes


sleepy: this is the missing link in AI research. @_nilradical

1 replies, 1 likes


unionized AI: @hautdesert i feel like this is entirely up yr alley / totally yr type of shit. https://arxiv.org/abs/1904.09828 https://t.co/bpZsQSkuqF

0 replies, 1 likes


damienfrancois: https://arxiv.org/abs/1904.09828 | Magic: The Gathering is Turing Complete

0 replies, 1 likes


Jason H. Moore, PhD: Magic The Gathering is Turing complete https://arxiv.org/abs/1904.09828 #games #mtg #MagicTheGathering #compsci https://t.co/rPgafW9Ut6

0 replies, 1 likes


Robert C. Smith: A new paper uploaded to the archive seeks to argue optimal play in #MtG is at least as hard as the Halting Problem. https://arxiv.org/pdf/1904.09828.pdf I have yet to read through it, but the arg. stands out that deterministic outcomes are non-computable @day9tv

0 replies, 1 likes


Urix Turing #EnComú: "Magic: The Gathering is Turing Complete" https://arxiv.org/abs/1904.09828

0 replies, 1 likes


Scott Kominers: Full paper here: https://arxiv.org/abs/1904.09828

2 replies, 1 likes


Itai Sher: “Magic: The Gathering is a popular ... card game about magical combat ... we present a methodology for embedding an arbitrary Turing machine into a game of Magic such that the first player is guaranteed to win the game if and only if the Turing machine halts.” ht @skominers

0 replies, 1 likes


moonpi: Magic: The Gathering is Turing Complete https://arxiv.org/abs/1904.09828

1 replies, 1 likes


Tabali Tigi: @attractfunding @maqstik "Magic: The Gathering is Turing Complete" https://arxiv.org/abs/1904.09828

0 replies, 1 likes


Pedro J. Ramos: “This is the first result showing that there exists a real-world game for which determining the winning strategy is non-computable”.

0 replies, 1 likes


Florian 🇪🇺: Magic: The Gathering is #Turing complete. Find ich klasse! :-) #MTG https://arxiv.org/abs/1904.09828

0 replies, 1 likes


Hacker News 100: Magic: The Gathering is Turing Complete https://arxiv.org/abs/1904.09828 (http://bit.ly/2H3Iyr4)

0 replies, 1 likes


John Golden 🔗: Magic: the Gathering is Turing complete. Officially the world's most computationally complex game. https://arxiv.org/abs/1904.09828 You should try it! cc @JSchwartz10a @mikeandallie @wobbles

1 replies, 0 likes


jon dutko: losing my mind very specifically over this m:tg legacy decklist which is also a turing machine source: https://arxiv.org/pdf/1904.09828.pdf https://t.co/ulD0SvBjZC

1 replies, 0 likes


Yo! MTG Taps!: I'm not sure I understand much of this but damn this is cool. Going to read the whole pdf later. (bhj)

1 replies, 0 likes


Content

Found on Jun 13 2019 at https://arxiv.org/pdf/1904.09828.pdf

PDF content of a computer science paper: Magic: The Gathering is Turing Complete