| Title:
|
On representability of P. Martin-Löf tests (English) |
| Author:
|
Calude, Cristian |
| Author:
|
Chiţescu, Ion |
| Language:
|
English |
| Journal:
|
Kybernetika |
| ISSN:
|
0023-5954 |
| Volume:
|
19 |
| Issue:
|
1 |
| Year:
|
1983 |
| Pages:
|
42-47 |
| . |
| Category:
|
math |
| . |
| MSC:
|
03D45 |
| idZBL:
|
Zbl 0529.03020 |
| . |
| Date available:
|
2009-09-24T17:32:07Z |
| Last updated:
|
2012-06-05 |
| Stable URL:
|
http://hdl.handle.net/10338.dmlcz/124469 |
| . |
| Reference:
|
[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 0691575 |
| Reference:
|
[2] A. N. Kolmogorov: Three approaches to the quantitative definition of information.Problems Inform. Transmission 1 (1965), 1 - 7. MR 0243922 |
| Reference:
|
[3] M. Machtey, P. Young: An Introduction to General Theory of Algorithms.North-Holland, New York 1978. MR 0483344 |
| Reference:
|
[4] P. Martin-Löf: The definition of random sequences.Inform. and Control 19 (1966), 602-619. MR 0223179 |
| Reference:
|
[5] H. Rogers, Jr.: The Theory of Recursive Functions and Effective Computability.McGraw-Hill, New York 1967. MR 0224462 |
| Reference:
|
[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, MR 0307889 |
| . |
