Publisher
Springer Berlin Heidelberg
Reference7 articles.
1. Lecture Notes in Computer Science;L. Antunes,2003
2. Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley, New York (1991)
3. Gács, P., Tromp, J., Vitányi, P.M.B.: Algorithmic statistics. IEEE Trans. Inform. Th. 47(6), 2443–2463 (2001)
4. Kolmogorov, A.N.: Talk at the Information Theory Symposium in Tallinn, Estonia (1974)
5. Shen, A.K.: Discussion on Kolmogorov complexity and statistical analysis. The Computer Journal 42(4), 340–342 (1999)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Algorithmic Statistics: Forty Years Later;Computability and Complexity;2016-12-01
2. Sophistication vs Logical Depth;Theory of Computing Systems;2016-03-19
3. On Approximate Decidability of Minimal Programs;ACM Transactions on Computation Theory;2015-09-11
4. Algorithmic Minimal Sufficient Statistics: a New Approach;Theory of Computing Systems;2015-02-13
5. Algorithmic Statistics Revisited;Measures of Complexity;2015