@article{KYB_1983_19_1_a3,
author = {Calude, Cristian and Chi\c{t}escu, Ion},
title = {On representability of {P.} {Martin-L\"of} tests},
journal = {Kybernetika},
pages = {42--47},
year = {1983},
volume = {19},
number = {1},
zbl = {0529.03020},
language = {en},
url = {http://geodesic.mathdoc.fr/item/KYB_1983_19_1_a3/}
}
Calude, Cristian; Chiţescu, Ion. On representability of P. Martin-Löf tests. Kybernetika, Tome 19 (1983) no. 1, pp. 42-47. http://geodesic.mathdoc.fr/item/KYB_1983_19_1_a3/
[1] C. Calude, I. Chiţescu: Random strings according to A. N. Kolmogorov and P. Martin-Löf - Classical approach. Found. Control Engng. (to appear). | MR
[2] A. N. Kolmogorov: Three approaches to the quantitative definition of information. Problems Inform. Transmission 1 (1965), 1 - 7. | MR
[3] M. Machtey, P. Young: An Introduction to General Theory of Algorithms. North-Holland, New York 1978. | MR
[4] P. Martin-Löf: The definition of random sequences. Inform. and Control 19 (1966), 602-619. | MR
[5] H. Rogers, Jr.: The Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York 1967. | MR
[6] A. Zvonkin, L. Levin: The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms. (in Russian). Uspechi Mat. Nauk 156 (1970), 85-127. | MR | Zbl