A notion of mechanistic theory

DOI10.1007/BF00484949zbMath0307.02028OpenAlexW4241042422MaRDI QIDQ1217700

Georg Kreisel

Publication date: 1974

Published in: Synthese (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00484949

Mathematics Subject Classification ID

Computability and recursion theory (03D99) Turing machines and related notions (03D10) Proof theory and constructive mathematics (03F99)

Related Items

Recursivity in Quantum Mechanics ⋮ Computations with oracles that measure vanishing quantities ⋮ Programming Experimental Procedures for Newtonian Kinematic Machines ⋮ Computability and Noncomputability in Classical Analysis ⋮ The wave equation with computable initial data such that its unique solution is not computable ⋮ Taking Physical Infinity Seriously ⋮ Experimental computation of real numbers by Newtonian machines ⋮ 2010 North American Annual Meeting of the Association for Symbolic Logic ⋮ Mathematical and Technological Computability ⋮ The eigenvalues of an effectively determined self-adjoint operator are computable, but the sequence of eigenvalues is not ⋮ From axiomatics to intrinsic characterization: some open problems in computable analysis ⋮ Is the human mind a Turing machine? ⋮ The complexity of proving chaoticity and the Church–Turing thesis ⋮ Noncomputability in analysis and physics: A complete determination of the class of noncomputable linear operators ⋮ The Significance of Relativistic Computation for the Philosophy of Mathematics

Cites Work

• Unnamed Item
• Polynomial functions with exponentiation are well ordered
• Stable and Random Motions in Dynamical Systems
• Some undecidable problems involving elementary functions of a real variable
• Solution of the identity problem for integral exponential functions
• Zwei Unentscheidbare Probleme Der Analysis
• Which number theoretic problems can be solved in recursive progressions on Π₁¹-paths through O?

This page was built for publication: A notion of mechanistic theory