INDUCTIVE COMPLEXITY MEASURES FOR MATHEMATICAL PROBLEMS

DOI10.1142/S0129054113500160zbMath1359.68149DBLPjournals/ijfcs/BurginCC13OpenAlexW2043185883WikidataQ57001485 ScholiaQ57001485MaRDI QIDQ2856020

Elena Calude, Mark S. Burgin, Cristian S. Calude

Publication date: 23 October 2013

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054113500160

zbMATH Keywords

complexity measure\(\Pi_2\)-sentenceinductive complexity

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• The complexity of Euler's integer partition theorem
• Fermat's last theorem and chaoticity
• The complexity of the four colour theorem
• EXACT APPROXIMATIONS OF OMEGA NUMBERS
• The 3x + 1 Problem and Its Generalizations
• Accessible Independence Results for Peano Arithmetic
• Computing a Glimpse of Randomness

This page was built for publication: INDUCTIVE COMPLEXITY MEASURES FOR MATHEMATICAL PROBLEMS