DeepAI
Log In Sign Up

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

09/28/2021

Compiling Turing Machines into Storage Modification Machines

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

Multiway Turing Machines

Multiway Turing machines (also known as nondeterministic Turing machines...
09/02/2015

Turing's Imitation Game has been Improved

Using the recently introduced universal computing model, called orchestr...
08/19/2021

Prof. Schönhage's Mysterious Machines

We give a simple Schönhage Storage Modification Machine that simulates o...
04/06/2020

Conditions for Open-Ended Evolution in Immigration Games

The Immigration Game (invented by Don Woods in 1971) extends the solitai...
02/24/2022

No-Regret Learning in Games is Turing Complete

Games are natural models for multi-agent machine learning settings, such...
06/26/2018

Self-Reproducing Coins as Universal Turing Machine

Turing-completeness of smart contract languages in blockchain systems is...