A program-size complexity measure for mathematical problems and conjectures

DOI10.1007/978-3-642-27654-5_7MaRDI QIDQ2891304zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• scientific article; zbMATH DE number 5234254
• Evaluating the complexity of mathematical problems. I
• scientific article; zbMATH DE number 5772857
• Inductive complexity measures for mathematical problems
• LISP program-size complexity. II

Cites work

• scientific article; zbMATH DE number 5772857 (Why is no real title available?)
• scientific article; zbMATH DE number 1911266 (Why is no real title available?)
• scientific article; zbMATH DE number 5234254 (Why is no real title available?)
• Algorithmic Information Theory
• Computing a Glimpse of Randomness
• EXACT APPROXIMATIONS OF OMEGA NUMBERS
• Evaluating the complexity of mathematical problems. I
• Fermat's last theorem and chaoticity
• The complexity of Riemann's hypothesis
• The complexity of proving chaoticity and the Church-Turing thesis
• The complexity of the four colour theorem

Cited in

(3)

• The complexity of Euler's integer partition theorem
• Evaluating the complexity of mathematical problems. I
• Inductive complexity of P versus NP problem (extended abstract)

This page was built for publication: A program-size complexity measure for mathematical problems and conjectures

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