Turing Tumble is Turing-Complete

10/18/2021
by   Lenny Pitt, et al.
0

It is shown that the toy Turing Tumble, suitably extended with an infinitely long game board and unlimited supply of pieces, is Turing-Complete. This is achieved via direct simulation of a Turing machine. Unlike previously informally presented constructions, we do not encode the finite control infinitely many times, we need only one trigger/ball-hopper pair, and we prove our construction correct. We believe this is the first natural extension of a marble-based computer that has been shown to be universal.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/27/2010

A Formalization of the Turing Test

The paper offers a mathematical formalization of the Turing test. This f...
research
08/28/2023

A conservative Turing complete S^4 flow

We present a Turing complete, volume preserving, smooth flow on the 4-sp...
research
03/15/2016

Turing learning: a metric-free approach to inferring behavior and its application to swarms

We propose Turing Learning, a novel system identification method for inf...
research
03/24/2019

Magic: The Gathering is Turing Complete

Magic: The Gathering is a popular and famously complicated trading card ...
research
03/11/2019

The relationship between word complexity and computational complexity in subshifts

We prove several results about the relationship between the word complex...
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
05/29/2019

Sub-Turing Islands in the Wild

Recently, there has been growing debate as to whether or not static anal...

Please sign up or login with your details

Forgot password? Click here to reset