### Magical Turing

2022-03-25 —
Michael Haupt

A while back, I had written about Alan Turing's work, and how Turing completeness is the ultimate level for any programming language or abstraction - enabling any algorithm to be expressed in it. Hold tight.

It turns out that the very popular card game Magic: The Gathering by Richard Garfield is * actually, provably Turing complete*. There is a scientific paper that proves it.

I've got to take some rest now.

Tags: the-nerdy-bit