Complexity of natural numbers

MaRDI QIDQ6382287zbMATH OpenFDO

Authors Juan Arias de Reyna Martinez

Publication date 5 November 2021

Mathematics Subject Classification ID

Other number representations (11A67) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Abstract: This is the English version of the paper: "Complejidad de los n'umeros naturales", Gaceta de la Real Sociedad Matem'atica Espa~nola 3 (2000) 230--250. In this paper, several conjectures about the complexity of natural numbers are proposed. In a recent joint paper with H. Altman "Integer Complexity, stability, and self-similarity" arXiv:2111.00671, we resolve the last of these conjectures. This is why I consider its translation useful now as a reference.

Recommendations

• Integer complexity: experimental and analytical results. II
• Numbers with integer complexity close to the lower bound
• Integer complexity: algorithms and computational results
• Integer complexity and well-ordering
• On algorithms to calculate integer complexity

Cited in

(2)

• The 2-complexity of even positive integers
• A binary version of the Mahler-Popken complexity function

This page was built for publication: Complexity of natural numbers

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