Editing 1223: Dwarf Fortress

{{comic
| number    = 1223
| date      = June 10, 2013
| title     = Dwarf Fortress
| image     = dwarf_fortress.png
| titletext = I may be the kind of person who wastes a year implementing a Turing-complete computer in Dwarf Fortress, but that makes you the kind of person who wastes ten more getting that computer to run Minecraft.
}}

==Explanation==
This comic is a reaction to the recent reveal of a U.S. electronic telecom surveillance program called {{w|PRISM (surveillance program)|PRISM}}, run by the NSA. You can read a [http://www.guardian.co.uk/world/2013/jun/06/us-tech-giants-nsa-data Guardian article] about it. PRISM, leaked by a former NSA official, incited some controversy since it provides government access to private data (e-mails, videos, chats, file transfers, etc.). <!-- please expand/correct this   ~Alpha -->

''{{w|Dwarf Fortress}}'' is a freeware strategy game in which the player builds a civilization by giving orders to — as opposed to directly controlling — a group of dwarves. It is famous for having a very detailed simulation of its world and for allowing deep micro-management (as well as an incredibly difficult learning curve).

"Big Brother" means "a tyrannical government body that constantly monitors all its citizens." The term comes from the classic dystopian novel ''{{w|Nineteen Eighty-Four}}'' by George Orwell, wherein propaganda videos are narrated by an actor with the stage name of Big Brother and the dystopia's surveillance system is said to be monitored by Big Brother himself.

[[Cueball]] has a discussion with Big Brother ("corporate surveillance state"), in which he mocks Big Brother's interest in the inconsequential activity of playing a video game (''Dwarf Fortress'' in particular) by drawing a parallel between Big Brother's omniscient surveillance of Cueball and Cueball's omniscient surveillance of the dwarves. Big Brother appears to be mortified when it realizes the accuracy of Cueball's comparison.

Informally, a system exhibits ''Turing-completeness'' when it is theoretically capable of executing any algorithm. One of the simplest Turing-complete systems is the {{w|Turing machine}}, a device that manipulates symbols on a strip of tape according to a table of rules — it {{w|Church-Turing thesis|can be proven}} to have the same capabilities as any ordinary programming language. Other very simple systems include {{w|Rule 110}}, {{w|lambda calculus}}, {{w|Conway's game of life}}, and {{w|Brainfuck}}. The reason we don't work with these is because they're a real pain in the ass. Would you rather build a network of spaceships that collide with each other to simulate the successor function, or just write <tt>i := i + 1</tt>?

A common CS nerd challenge is to prove the Turing-completeness of a system that wasn't intended to be that way &mdash; games in particular. The usual way to do this is to construct a Turing machine simulator within the system. It has been done for [http://mkv25.net/dfma/map-8269 Dwarf Fortress], [http://web.mat.bham.ac.uk/R.W.Kaye/minesw/infmsw.pdf (infinite) Minesweeper] (pdf), [http://www.toothycat.net/~hologram/Turing/HowItWorks.html Magic the Gathering], [http://www.youtube.com/watch?v=13GOFa1C4e4 Little Big Planet], [http://www.youtube.com/watch?v=1X21HQphy6I Minecraft] ([http://www.youtube.com/watch?v=7sNge0Ywz-M another Minecraft example]), [http://aurellem.org/vba-clojure/html/total-control.html Pokémon Yellow] (through the elaborate use of many in-game glitches) and [http://cp4space.wordpress.com/2013/04/05/3d-chess-is-turing-complete/ 3D chess] (but see the note below). These kinds of proofs often involve formulating ridiculously complex creations just to simulate a little machine writing symbols on a tape!

<small>(Technically, a computer is not really Turing-complete. A Turing-complete system has to have unlimited space, and that's not possible for a memory-limited computer or any software running inside it. But even if we don't have access to Turing-completeness, we can build a theoretical machine and show how it can be extended indefinitely. In a few of the games, we prove Turing-completeness in infinite variants.)</small>

Finally, Randall makes a crack that users will try to nest their Turing-complete computers; after finishing his Turing-complete Dwarf Fortress computer, someone else will try to make the Dwarf Fortress computer run Minecraft (a highly inefficient process that would be a nightmare to co-ordinate, and would run incredibly slowly).

==Transcript==
:[Cueball sits at a desk with a computer, hands on the keyboard, talking to an unseen observer.]
:Cueball: If the corporate surveillance state monitors and controls every aspect of my life...
:Big Brother: We do.
:Cueball: And I play Dwarf Fortress all day...
:Big Brother: You do.
:Cueball: Then you're effectively Dwarf Fortress players watching your dwarves play Dwarf Fortress.
:Big Brother: ... Oh God.
:[Caption below the panel:]
:Big Brother realizes he's trapped in the most tedious possible Hell.

{{comic discussion}}
[[Category:Programming]]
[[Category:Comics featuring Cueball]]
[[Category:Video games]]
[[Category:Politics]]
[[Category:Comics with color]]
[[Category:Fiction]]