Undecidability in physics: a review
From MaRDI portal
Decidability of theories and sets of sentences (03B25) Turing machines and related notions (03D10) Research exposition (monographs, survey articles) pertaining to quantum theory (81-02) History of quantum theory (81-03) General and philosophical questions in quantum theory (81P05) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)
Cites work
- A formal proof of the Kepler conjecture
- A formal theory of inductive inference. Part II
- A proof of the Kepler conjecture
- A Quantum Version of Wielandt's Inequality
- A Relatively Small Turing Machine Whose Behavior Is Independent of Set Theory
- A Suppes predicate for general relativity and set-theoretically generic spacetimes
- A survey of computational complexity results in systems and control
- A Theory of Program Size Formally Identical to Information Theory
- A variant of a recursively unsolvable problem
- Algorithmic Computability of the Signal Bandwidth
- An area law for one-dimensional quantum systems
- An Introduction to Gödel's Theorems
- An introduction to Kolmogorov complexity and its applications
- An Unsolvable Problem of Elementary Number Theory
- Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
- Classes of Recursively Enumerable Sets and Their Decision Problems
- Computability and Beltrami fields in Euclidean space
- Computational complexity of the ground state energy density problem
- Computational universes
- Connes' embedding problem and Tsirelson's problem
- Conservative logic
- Constructing Turing complete Euler flows in dimension 3
- Decidability and undecidability in cellular automata
- Decidability of fully quantum nonlocal games with noisy maximally entangled states
- Deciding stability and mortality of piecewise affine dynamical systems
- Degrees of Computability
- Finite time blowup for an averaged three-dimensional Navier-Stokes equation
- Finitely correlated states on quantum spin chains
- From Heisenberg to Gödel via Chaitin
- Frontier between decidability and undecidability: A survey
- Fundamental limitations in the purifications of tensor networks
- Generalized shifts: unpredictability and undecidability in dynamical systems
- Gödel and physics
- Gödel's proof. Edited and with a new foreword by Douglas R. Hofstadter
- Hamiltonian complexity in the thermodynamic limit
- scientific article; zbMATH DE number 1818513 (Why is no real title available?)
- scientific article; zbMATH DE number 3427210 (Why is no real title available?)
- scientific article; zbMATH DE number 5702692 (Why is no real title available?)
- scientific article; zbMATH DE number 5711305 (Why is no real title available?)
- scientific article; zbMATH DE number 3896307 (Why is no real title available?)
- scientific article; zbMATH DE number 3898248 (Why is no real title available?)
- scientific article; zbMATH DE number 1189116 (Why is no real title available?)
- scientific article; zbMATH DE number 545277 (Why is no real title available?)
- scientific article; zbMATH DE number 2061729 (Why is no real title available?)
- scientific article; zbMATH DE number 1909828 (Why is no real title available?)
- scientific article; zbMATH DE number 1911266 (Why is no real title available?)
- scientific article; zbMATH DE number 2198106 (Why is no real title available?)
- scientific article; zbMATH DE number 3417456 (Why is no real title available?)
- scientific article; zbMATH DE number 5187689 (Why is no real title available?)
- scientific article; zbMATH DE number 3037155 (Why is no real title available?)
- Improved Undecidability Results on the Emptiness Problem of Probabilistic and Quantum Cut-Point Languages
- Learning recursive functions: A survey
- Logical Approaches to Computational Barriers
- Logical independence and quantum randomness
- Machines, Computations, and Universality
- Many bounded versions of undecidable problems are \textsf{NP}-hard
- Measurement-based quantum computation and undecidable logic
- Modular elliptic curves and Fermat's Last Theorem
- More really is different
- Necessary and Sufficient Conditions for Quantum Computation
- Nonlocal Games with Noisy Maximally Entangled States are Decidable
- On computable numbers, with an application to the Entscheidungsproblem.
- On the Length of Programs for Computing Finite Binary Sequences
- On the set of reduced states of translation invariant, infinite quantum systems
- On the solvability complexity index, the n-pseudospectrum and approximations of spectra of operators
- On the universality of potential well dynamics
- On the universality of the incompressible Euler equation on compact manifolds
- Physical (a)causality. Determinism, randomness and uncaused events
- Physical unknowables
- Physics of selective systems: Computation and biology
- Probabilistic automata on finite words: decidable and undecidable problems
- Quantum and non-signalling graph isomorphisms
- Quantum complementarity and logical indeterminacy
- Quantum Complexity Theory
- Quantum isomorphism is equivalent to equality of homomorphism counts from planar graphs
- Quantum logic is undecidable
- Quantum proof systems for iterated exponential time, and beyond
- Recursive Real Numbers
- Rice's theorem for the limit sets of cellular automata
- Ring-theoretic properties of certain Hecke algebras
- Shannon meets Turing: non-computability and non-approximability of the finite state channel capacity
- Size-driven quantum phase transitions
- Some undecidable problems involving elementary functions of a real variable
- Strong determinism vs. computability
- Survey on nonlocal games and operator space theory
- Tensor networks for dimensionality reduction and large-scale optimization. I: Low-rank tensor decompositions
- The decision problem for exponential diophantine equations
- The foundations of spectral computations via the solvability complexity index hierarchy
- The Incomputable
- The set of quantum correlations is not closed
- The stability of saturated linear dynamical systems is undecidable
- The structure of the models of decidable monadic theories of graphs
- The Undecidability of the Existence of Zeros of Real Elementary Functions
- The unreasonable effectiveness of mathematics in the natural sciences. Richard courant lecture in mathematical sciences delivered at New York University, May 11, 1959
- The wave equation with computable initial data such that its unique solution is not computable
- The word problem
- Tsirelson's problem and an embedding theorem for groups arising from non-local games
- Tsirelson's problem and Kirchberg's conjecture
- Undecidability and incompleteness in classical mechanics
- Undecidability and nonperiodicity for tilings of the plane
- Undecidability of the Spectral Gap
- Undecidability principle and the uncertainty principle even for classical systems
- Undecidable problems in quantum field theory
- Undecidable problems: a sampler
- Universal computation and physical dynamics
- Universality in elementary cellular automata
- Unpredictability and undecidability in dynamical systems
- Unsolvability in 3 × 3 Matrices
- Vertex-minors, monadic second-order logic, and a conjecture by Seese
- Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme. I.
This page was built for publication: Undecidability in physics: a review
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6909619)
