scientific article; zbMATH DE number 5772857

MaRDI QIDQ3584055zbMATH OpenFDO

Authors Elena Calude, Cristian S. Calude

Publication date 18 August 2010

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Evaluating the complexity of mathematical problems. I
• Inductive complexity measures for mathematical problems
• scientific article; zbMATH DE number 3420721
• A framework for measuring the complexity of mathematical concepts
• scientific article; zbMATH DE number 799791
• scientific article; zbMATH DE number 1197456
• Complexity classes as mathematical axioms. II
• Towards a mathematics of complexity

Cited in

(16)

• The Riemann hypothesis in computer science
• The axiomatic power of Kolmogorov complexity
• Fermat's last theorem and chaoticity
• A computation model with automatic functions and relations as primitive operations
• Inductive complexity measures for mathematical problems
• A program-size complexity measure for mathematical problems and conjectures
• Inductive complexity of P versus NP problem (extended abstract)
• Gödel diffeomorphisms
• Evaluating the complexity of mathematical problems. I
• The complexity of Riemann's hypothesis
• Inductive complexity of the P versus NP problem
• scientific article; zbMATH DE number 5234254 (Why is no real title available?)
• Approximating Kolmogorov complexity
• On some algebraic ways to calculate zeros of the Riemann zeta function
• Simplicity via provability for universal prefix-free Turing machines
• The complexity of Euler's integer partition theorem

This page was built for publication:

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