Inductive Complexity of Goodstein’s Theorem

DOI10.1007/978-3-642-32894-7_14MaRDI QIDQ4648198zbMATH OpenOpenAlexFDO

Authors Joachim Hertel

Publication date 8 November 2012

Published in Unconventional Computation and Natural Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32894-7_14

zbMATH Keywords

decidabilityGoodstein's theoreminductive complexityinductive Turing machine

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Complexity of computation (including implicit computational complexity) (03D15) First-order arithmetic and fragments (03F30) Analysis of algorithms and problem complexity (68Q25) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• New Computational Paradigms
• Inductive complexity of the P versus NP problem
• On the complexity of inductive definitions
• Inductive complexity of P versus NP problem (extended abstract)
• Inductive complexity measures for mathematical problems
• Complexity-based induction
• scientific article; zbMATH DE number 3935022
• On the complexity of inductive inference
• scientific article; zbMATH DE number 2110622
• Proof complexity of intuitionistic implicational formulas

Cited in

(5)

• An almost machine-independent theory of program-length complexity, sophistication, and induction
• scientific article; zbMATH DE number 440481 (Why is no real title available?)
• On the complexity of inductive definitions
• Acceptable complexity measures of theorems
• On the quantifier complexity of \(\Delta_{n+1}(T)\)-induction

This page was built for publication: Inductive Complexity of Goodstein’s Theorem

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