Machine learning of the prime distribution

Alexander Kolpakov and A Alistair Rocke

PLOS ONE, 2024, vol. 19, issue 9, 1-12

Abstract: In the present work we use maximum entropy methods to derive several theorems in probabilistic number theory, including a version of the Hardy–Ramanujan Theorem. We also provide a theoretical argument explaining the experimental observations of Y.–H. He about the learnability of primes, and posit that the Erdős–Kac law would very unlikely be discovered by current machine learning techniques. Numerical experiments that we perform corroborate our theoretical findings.

Date: 2024
References: Add references at CitEc
Citations:

Downloads: (external link)
https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0301240 (text/html)
https://journals.plos.org/plosone/article/file?id= ... 01240&type=printable (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:plo:pone00:0301240

DOI: 10.1371/journal.pone.0301240

Access Statistics for this article

More articles in PLOS ONE from Public Library of Science
Bibliographic data for series maintained by plosone ().