Design and Empirical Characterization of a Hardware-Realized Turing Machine with Automated Card-Based Programming

arXiv:2608.24742 · cs.LO, cs.CL · Submitted 2026-08-25 · Read on arXiv

cs.LO, cs.CL

Submitted: 2026-08-25

Updated: 2026-08-25

Code: https://github.com/monoastro/tlang

Terminology

• Accuracy — 18× in this paper · explained in 1 episode
• Verification — 9× in this paper · explained in 2 episodes
• Alignment — 4× in this paper · explained in 1 episode
• Consistency — 4× in this paper · explained in 3 episodes
• Universal Turing Machine — 3× in this paper
• Breadth-First Search — 2× in this paper
• Java Formal Languages and Automata Package — 2× in this paper
• Robustness — 2× in this paper · explained in 5 episodes
• Associative Memory — 1× in this paper · explained in 2 episodes
• Decode — 1× in this paper · explained in 2 episodes
• Decoupling — 1× in this paper · explained in 2 episodes
• Entanglement — 1× in this paper · explained in 4 episodes
• Medium-Density Fiberboard — 1× in this paper

Sources

• Turing Tumble is Turing-Complete
• A Distributed Extension of the Turing Machine
• Comparative Analysis of Control Strategies for Position Regulation in DC Servo Motors

Related papers

• An Information-Flow Perspective on Explainability Requirements: Specification and Verification
• A programming language combining quantum and classical control
• Causal Past Logic for Runtime Verification of Distributed LLM Agent Workflows
• Encoder-Decoder Transformers: Logical Characterizations and Periodicity
• Ultraconstructive Model Theory via Bounded Adversarial Finite Structures