Inductive Complexity of Goodstein’s Theorem

DOI10.1007/978-3-642-32894-7_14zbMath1375.68066OpenAlexW117996040MaRDI QIDQ4648198

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 Turing machineinductive complexity

Mathematics Subject Classification ID

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

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