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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Theoretical computer science Ročník 948; s. 113734
Hlavní autor: Pitt, Lenny
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 28.02.2023
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2023.113734