How pinball Wizards simulate a Turing machine

DOI10.4230/LIPICS.FSTTCS.2025.4MaRDI QIDQ7391872zbMATH OpenFDO

Authors Rosemary U. Adejoh, Andreas Jakoby, Sneha Mohanty, Christian Schindelhauer

Publication date 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.FSTTCS.2025.4

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Cites work

• \textit{Physarum} can compute shortest paths
• Computability and complexity of ray tracing
• Computational complexity of puzzles and related topics
• Computational complexity of two-dimensional platform games
• Computing Naturally in the Billiard Ball Model
• Conservative logic
• scientific article; zbMATH DE number 3898247 (Why is no real title available?)
• scientific article; zbMATH DE number 2115805 (Why is no real title available?)
• Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics
• Push-pull block puzzles are hard
• The complexity of speedrunning video games

This page was built for publication: How pinball Wizards simulate a Turing machine

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