A program-size complexity measure for mathematical problems and conjectures

DOI10.1007/978-3-642-27654-5_7zbMATH Open1353.68144OpenAlexW2851918MaRDI QIDQ2891304FDOQ2891304

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

Recommendations

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Algorithmic Information Theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Evaluating the complexity of mathematical problems. I
• The complexity of the four colour theorem
• The complexity of Riemann's hypothesis
• EXACT APPROXIMATIONS OF OMEGA NUMBERS
• Computing a Glimpse of Randomness
• The complexity of proving chaoticity and the Church–Turing thesis
• Fermat's last theorem and chaoticity

Cited In (3)

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

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)