×

zbMATH — the first resource for mathematics

On representability of P. Martin-Loef tests. (English) Zbl 0529.03020

MSC:
03D45 Theory of numerations, effectively presented structures
PDF BibTeX XML Cite
Full Text: EuDML
References:
[1] C. Calude, I. Chiţescu: Random strings according to A. N. Kolmogorov and P. Martin-Löf - Classical approach. Found. Control Engng. · Zbl 0632.03041
[2] A. N. Kolmogorov: Three approaches to the quantitative definition of information. Problems Inform. Transmission 1 (1965), 1 - 7.
[3] M. Machtey, P. Young: An Introduction to General Theory of Algorithms. North-Holland, New York 1978. · Zbl 0376.68027
[4] P. Martin-Löf: The definition of random sequences. Inform. and Control 19 (1966), 602-619. · Zbl 0244.62008
[5] H. Rogers, Jr.: The Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York 1967.
[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. · Zbl 0222.02027
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.