Algorithmic statistics

IEEE Transactions on Information Theory

Volumn 47, Issue 6, 2001, Pages 2443-2463

  Gács, Péter ^a   Tromp, John T ^b   Vitányi, Paul M B ^b,c  

^a BOSTON UNIVERSITY   (United States)

^b CWI   (Netherlands)

^c UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

Algorithmic information theory; Description format (explicit, implicit); Foundations of statistics; Kolmogorov complexity; Minimal sufficient statistic (algorithmic); Mutual information (algorithmic); Nonstochastic objects; Sufficient statistic (algorithmic); Two part codes

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); CONSTRAINT THEORY; FUNCTION EVALUATION; PROBABILITY DISTRIBUTIONS; STATISTICAL METHODS;

ALGORITHMIC INFORMATION THEORY; ALGORITHMIC STATISTICS; KOLMOGOROV COMPLEXITY; KOLMOGOROV STRUCTURE FUNCTION; MODEL-TO-DATA CODE; NONSTOCHASTIC OBJECTS; PROBABILISTIC STATISTICAL THEORY; TWO PART CODES;

INFORMATION THEORY;

EID: 0035443482     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.945257     Document Type: Article

References (23)

1. Sophistication revisited
2. The minimum description length principle in coding and modeling
3. A theory of program size formally identical to information theory
4. Kolmogorov complexity, data compression, and inference
5. On the mathematical foundations of theoretical statistics
6. On the symmetry of algorithmic information
7. Toward an algorithmic statistics
8. Applying MDL to learn best model granularity
9. Three approaches to the quantitative definition of information
10. On logical foundations of probability theory
11. Algorithms and randomness
12. Laws of information conservation (nongrowth) and aspects of the foundation of probability theory
13. Randomness conservation inequalities: Information and independence in mathematical theories
14. The definition of random sequences
15. The concept of (α β)-stochasticity in the Kolmogorov sense, and its properties
16. Discussion on Kolmogorov complexity and statistical analysis
17. A formal theory of inductive inference, Part 1 and Part 2
18. Minimum description length induction, Bayesianism, and Kolmogorov complexity
19. On the defect of randomness of a finite object with respect to measures with given complexity bounds
20. Algorithmic complexity and stochastic properties of finite binary sequences
21. Correction to 'On the symmetry of algorithmic information'