A unified approach to the definition of random sequences-Reference-Cited by-同舟云学术

A unified approach to the definition of random sequences

Published:1971-09 Issue:3 Volume:5 Page:246-258
ISSN:0025-5661
Container-title:Mathematical Systems Theory
language:en
Short-container-title:Math. Systems Theory

Author:

Schnorr C. P.

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF01694181.pdf

Reference17 articles.

1. E. Bishop,Foundations of Constructive Analysis, McGraw-Hill, New York, 1967.

2. L. E. J. Brouwer, Begründung der Mengenlehre unabhängig vom logischen Satz vom ausgeschlossenen Dritten. Zweiter Teil. Verh. Niederl. Akad. Wetensch. Afd. Natuurk. Sect. I12 (1919), 7.

3. J. Hartmanis andR. E. Stearns, On the computational complexity of algorithms,Trans. Amer. Math. Soc. 117 (1965), 285–306.

4. A. N. Kolmogoroff, Tri podhoda k opredeleniju ponjatija “količestvo informacii”,Problemy Peredači Informacii 1 (1965), 3–11.

5. D. Loveland, On minimal program complexity measures,ACM Symposium on Theory of Computing, pp. 61–66, May 5–7, 1969.

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

1. From Wald to Schnorr: von Mises’ definition of randomness in the aftermath of Ville’s Theorem;Studies in History and Philosophy of Science;2024-08

2. Imprecision in martingale- and test-theoretic prequential randomness;International Journal of Approximate Reasoning;2024-07

3. Tight Concentrations and Confidence Sequences From the Regret of Universal Portfolio;IEEE Transactions on Information Theory;2024-01

4. Bayesian merging of opinions and algorithmic randomness;The British Journal for the Philosophy of Science;2022-07-19

5. On continued fraction randomness and normality;Information and Computation;2022-05