Turing Completeness and Sid Meier's Civilization

04/29/2021
by   Adrian de Wynter, et al.
0

We prove that three strategy video games from the Sid Meier's Civilization series: Sid Meier's Civilization: Beyond Earth, Sid Meier's Civilization V, and Sid Meier's Civilization VI, are Turing complete. We achieve this by building three universal Turing machines-one for each game-using only the elements present in the games, and using their internal rules and mechanics as the transition function. The existence of such machines imply that under the assumptions made, the games are undecidable. We show constructions of these machines within a running game session, and we provide a sample execution of an algorithm-the three-state Busy Beaver-with one of our machines.

READ FULL TEXT

page 4

page 6

page 8

page 10

page 15

research
09/28/2021

Compiling Turing Machines into Storage Modification Machines

It is well known that Schönhage's Storage Modification Machines (SMM) ca...
research
03/08/2021

Multiway Turing Machines

Multiway Turing machines (also known as nondeterministic Turing machines...
research
08/31/2022

Python Type Hints are Turing Complete

Grigore showed that Java generics are Turing complete by describing a re...
research
08/20/2023

Computing backwards with Game of Life, part 1: wires and circuits

Conway's Game of Life is a two-dimensional cellular automaton. As a dyna...
research
06/26/2018

Self-Reproducing Coins as Universal Turing Machine

Turing-completeness of smart contract languages in blockchain systems is...
research
11/08/2015

(Yet) Another Theoretical Model of Thinking

This paper presents a theoretical, idealized model of the thinking proce...
research
01/29/2023

A Log-Sensitive Encoding of Turing Machines in the λ-Calculus

This note modifies the reference encoding of Turing machines in the λ-ca...

Please sign up or login with your details

Forgot password? Click here to reset