A Relatively Small Turing Machine Whose Behavior Is Independent of Set Theory

DOI10.25088/ComplexSystems.25.4.297zbMath1445.03046arXiv1605.04343MaRDI QIDQ5126830

Adam B. Yedidia, Scott Aaronson

Publication date: 20 October 2020

Published in: Complex Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.04343

Mathematics Subject Classification ID

Consistency and independence results (03E35) Turing machines and related notions (03D10) Classical models of computation (Turing machines, etc.) (68Q04)

Related Items (7)

Undecidability of the Spectral Gap ⋮ Undecidable problems in quantum field theory ⋮ On some algebraic ways to calculate zeros of the Riemann zeta function ⋮ The Riemann hypothesis as the parity of special binomial coefficients ⋮ Embedding of provably unsolvable problems into stream ciphers;Встраивание доказуемо неразрешимых задач в шифры гаммирования ⋮ The Riemann hypothesis in computer science ⋮ Average-Case Completeness in Tag Systems

This page was built for publication: A Relatively Small Turing Machine Whose Behavior Is Independent of Set Theory