Representability of recursive P. Martin-Löf tests
Cristian S. Calude; Ion Chiţescu
Kybernetika (1983)
- Volume: 19, Issue: 6, page 526-536
- ISSN: 0023-5954
Access Full Article
topHow to cite
topReferences
top- C. Calude, I. Chijescu, Random strings according to A. N. Kolmogorov and P. Martin-Löf. Classical approach, Found. Control Engrg. 3 (1982), 73 - 85. (1982) MR0691575
- C. Calude, I. Chitescu, On representability of P. Martin-Löf tests, Kybernetika 19 (1983), 42-47. (1983) Zbl0529.03020MR0734837
- A. N. Kolmogorov, Three approaches to the quantitative definition of information, Problems Inform. Transmission 1 (1965), 1 - 7. (1965) MR0184801
- M. Machtey, P. Young, An Introduction to the General Theory of Algorithms, North-Holland, Amsterdam 1978. (1978) Zbl0376.68027MR0483344
- P. Martin-Löf, The definition of random sequences, Inform. and Control 19 (1966), 602-619. (1966) MR0223179
- H. Rogers, Jr., The Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York 1967. (1967) MR0224462
- V. A. Uspensky, A. L. Semenov, What are the gains of the theory of algorithms, In: Algorithms in Modern Mathematics and Computer Science (A. P. Ersov, D. E. Knuth, eds.), Springer-Verlag, Berlin-Heidelberg-New York 1981, 100-234. (1981) MR0657617