Algorithmic randomness and monotone complexity on product space-Reference-Cited by-同舟云学术

Algorithmic randomness and monotone complexity on product space

Published:2011-02 Issue:2 Volume:209 Page:183-197
ISSN:0890-5401
Container-title:Information and Computation
language:en
Short-container-title:Information and Computation

Author:

Takahashi Hayato

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science

Reference25 articles.

1. The minimum description length principle in coding and modeling;Barron;IEEE Trans. Inform. Theory,1998

2. A.R. Barron, Logically smooth density estimation, PhD Thesis, Stanford Univ., 1985.

3. Effective randomness for computable probability measures;Bienvenu;Electron. Notes Theor. Comput. Sci.,2007

4. On some asymptotic properties of maximum likelihood estimates and related Bayes estimates;Le Cam;Univ. California Publ. Stat.,1953

5. A. Chernov, M. Hutter, Monotone conditional complexity bounds on future prediction errors, in: ALT 2005, LNAI, vol. 3734, Springer, 2005, pp. 414–428.

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Bayesian definition of random sequences with respect to conditional probabilities;Information and Computation;2023-06

2. Bibliography;Information Theory Meets Power Laws;2020-09-14

3. Schnorr randomness for noncomputable measures;Information and Computation;2018-02

4. Layerwise Computability and Image Randomness;Theory of Computing Systems;2017-06-22

5. Conditional Probabilities and van Lambalgen’s Theorem Revisited;Theory of Computing Systems;2017-06-17