A Program-Size Complexity Measure for Mathematical Problems and Conjectures

DOI10.1007/978-3-642-27654-5_7zbMath1353.68144OpenAlexW2851918MaRDI QIDQ2891304

Michael J. Dinneen

Publication date: 15 June 2012

Published in: Computation, Physics and Beyond (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-27654-5_7

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Data structures (68P05) Descriptive complexity and finite models (68Q19)

Related Items (2)

Inductive Complexity of P versus NP Problem ⋮ The complexity of Euler's integer partition theorem

Cites Work

• Fermat's last theorem and chaoticity
• The complexity of the four colour theorem
• EXACT APPROXIMATIONS OF OMEGA NUMBERS
• Algorithmic Information Theory
• The complexity of proving chaoticity and the Church–Turing thesis
• Computing a Glimpse of Randomness
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Program-Size Complexity Measure for Mathematical Problems and Conjectures