Turing Tumble is Turing-Complete

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 infin...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 948; p. 113734
Main Author:	Pitt, Lenny
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 28.02.2023
Subjects:	Computability Marble-based computation Models of computation Turing tumble Turing-complete Models of computation Marble-based computation Turing-complete Turing tumble Computability
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!