Somebody proved that "who wins in a game of Magic" is non-computable. In fact, they did it by showing that some Turing-machine-playable version of the game is equivalent to the halting problem.

Mind blown.

@DialMforMara Their Turing machine deck is even tournament-legal (for Legacy)!

Sign in to participate in the conversation

We are an inclusive community for fans and players of the trading card game Magic: the Gathering.

We encourage sharing and friendly discussion of publicly available Magic: the Gathering content, as well as play-by-post paper Magic. WUBRG is pronounced WOO-berg; it represents the five colors in the Magic color pie (White, blUe, Black, Red, and Green). We are inclusive and welcoming of the whole color pie of Magic fans and players. If you come here to be a jerk or to harass other members, you will not be welcome here.