Inductive complexity measures for mathematical problems

DOI10.1142/S0129054113500160MaRDI QIDQ2856020zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Elena Calude, Mark 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

\(\Pi_2\)-sentencecomplexity measureinductive complexity

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 5772857
• Inductive complexity of the P versus NP problem
• scientific article; zbMATH DE number 5234254
• Inductive complexity of P versus NP problem (extended abstract)
• Evaluating the complexity of mathematical problems. I

Cites work

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

Cited in

(6)

• A program-size complexity measure for mathematical problems and conjectures
• scientific article; zbMATH DE number 5772857 (Why is no real title available?)
• Inductive complexity of P versus NP problem (extended abstract)
• Inductive Complexity of Goodstein’s Theorem
• Evaluating the complexity of mathematical problems. I
• Inductive complexity of the P versus NP problem

This page was built for publication: Inductive complexity measures for mathematical problems

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