3 papers
cs.CC2026
Randomness Conservation Inequalities; Information and Independence in Mathematical Theories
Leonid A. Levin
The article develops further Kolmogorov's Algorithmic Complexity Theory. The definition of Randomness is modified to satisfy strong invariance properties (conservation inequalities…
gr-qc2026
Assumptions of Randomness in Cosmology Models
Leonid A. Levin
Non-compact symmetries cannot be fully broken by randomness since non-compact groups have no invariant probability distributions. In particular, this makes trickier the "Copernican…
cs.CC2026
How do humans succeed in tasks like proving Fermat's Theorem or predicting the Higgs boson?
Leonid A. Levin
I discuss issues of inverting feasibly computable functions, optimal discovery algorithms, and the constant overheads in their performance.