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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science Jg. 948; S. 113734
1. Verfasser:	Pitt, Lenny
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 28.02.2023
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!