Universal logic elements constructed on the Turing tumble

DOI10.1007/S11047-019-09760-8MaRDI QIDQ6151192zbMATH OpenFDO

Authors Takahiro Tomita, Jia Lee, Teijiro Isokawa, Ferdinand Peper, Takayuki Yumoto, Naotake Kamiura

Publication date 9 February 2024

Published in Natural Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11047-019-09760-8

zbMATH Keywords

computational universalitymechanical computersequential machine

Mathematics Subject Classification ID

Other nonclassical models of computation (68Q09)

Recommendations

• Turing Tumble is Turing-complete
• Turing Tumble is P(SPACE)-complete
• A physically universal Turing machine
• On Frictional Mechanical Systems and Their Computational Power
• Babbage meets Zuse: a minimal mechanical computer

Cites work

• Design of 1-tape 2-symbol reversible Turing machines based on reversible logic elements
• General design of reversible sequential machines based on reversible logic elements
• On DNA-based gellular automata

Cited in

(1)

• Universality of Turing Tumble of finite size

This page was built for publication: Universal logic elements constructed on the Turing tumble

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6151192)