@InProceedings{churchill_et_al:LIPIcs.FUN.2021.9,
  author =	{Churchill, Alex and Biderman, Stella and Herrick, Austin},
  title =	{{Magic: The Gathering Is Turing Complete}},
  booktitle =	{10th International Conference on Fun with Algorithms (FUN 2021)},
  pages =	{9:1--9:19},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-145-0},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{157},
  editor =	{Farach-Colton, Martin and Prencipe, Giuseppe and Uehara, Ryuhei},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2021.9},
  URN =		{urn:nbn:de:0030-drops-127706},
  doi =		{10.4230/LIPIcs.FUN.2021.9},
  annote =	{Keywords: Turing machines, computability theory, Magic: the Gathering, two-player games}
}