Turing Tumble is Turing-complete
type: Item
instance of: scholarly article
title: Turing Tumble is Turing-complete
author: Lenny Pitt
published in: Theoretical Computer Science
publication date: 2023-02-13T00:00:00Z
full work available at URL: https://arxiv.org/abs/2110.09343
Mathematics Subject Classification ID: 68Q09
Mathematics Subject Classification ID: 68Q04
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 7653191
zbMATH Keywords: Turing-completeness
zbMATH Keywords: Turing Tumble
zbMATH Keywords: computability
zbMATH Keywords: models of computation
zbMATH Keywords: marble-based computation
MaRDI profile type: Publication
OpenAlex ID: W3205891022
cites work: Turing Tumble is P(SPACE)-complete
DOI: 10.1016/J.TCS.2023.113734
Recommended article: Turing Tumble is P(SPACE)-complete
Recommended article: Turing-Completeness Totally Free
Recommended article: Turing Jumps Through Provability
Recommended article: Turing jumps in the Ershov hierarchy
Recommended article: Involutory Turing machines
Recommended article: Complementation in the Turing degrees
Recommended article: Turing reducibility in the fine hierarchy
Recommended article: Turing Completeness Using Three Mobile Membranes
Recommended article: The logic of Turing progressions
Recommended article: Q5396377
description: scientific article