Zipf's law and L. Levin probability distributions
From MaRDI portal
Publication:2258210
DOI10.1007/s10688-014-0052-1zbMath1347.03080arXiv1301.0427OpenAlexW2059028313MaRDI QIDQ2258210
Publication date: 3 March 2015
Published in: Functional Analysis and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1301.0427
Combinatorial probability (60C05) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Algorithmic randomness and dimension (03D32)
Related Items (3)
Semantic spaces ⋮ Error-correcting codes and neural networks ⋮ Probabilistic Properties of Zipf Sets and Their Maximal Intersections
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The fractal nature of Riem/Diff. I.
- Kolmogorov complexity and the asymptotic bound for error-correcting codes
- Renormalisation and computation II: time cut-off and the Halting Problem
- Towards a Definition of an Algorithm
- PageRank of integers
- Gödel numberings of partial recursive functions
- On universal computably enumerable prefix codes
- A Course in Mathematical Logic for Mathematicians
- Optimal enumerations and optimal gödel numberings
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
This page was built for publication: Zipf's law and L. Levin probability distributions