QUANTITATIVE AND QUALITATIVE INFORMATION IN COMPUTATIONS

[1] BARZDINS JANIS, 1968, SOV MATH DOKL, V9, P1251

[2] ON LENGTH OF PROGRAMS FOR COMPUTING FINITE BINARY SEQUENCES [J]. JOURNAL OF THE ACM, 1966, 13 (04) : 547 - +

[3] CHAITIN GJ, 1977, OSAKA J MATH, V14, P139

[4] DALEY R, 1971, 7128 CARN MELL U TEC

[5] DALEY R, 1972, 32 U CHIC I COMP RES

[6] DALEY R, 1977, J SYMBOLIC LOGIC, V41, P626

[7] EXTENT AND DENSITY OF SEQUENCES WITHIN MINIMAL-PROGRAM COMPLEXITY HIERARCHIES [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1974, 9 (02) : 151 - 163

[8] Katseff H. P., 1977, 18th Annual Symposium on Foundations of Computer Science, P82, DOI 10.1109/SFCS.1977.28

[9] KOLMOGOROV A. N., 1965, PROBL PEREDACHI INF, V1, P3

[10] A NEW INTERPRETATION OF VON MISES CONCEPT OF RANDOM SEQUENCE [J]. ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DER MATHEMATIK, 1966, 12 (04): : 279 - &

[1] BARZDINS JANIS, 1968, SOV MATH DOKL, V9, P1251

[2] ON LENGTH OF PROGRAMS FOR COMPUTING FINITE BINARY SEQUENCES [J]. JOURNAL OF THE ACM, 1966, 13 (04) : 547 - +

[3] CHAITIN GJ, 1977, OSAKA J MATH, V14, P139

[4] DALEY R, 1971, 7128 CARN MELL U TEC

[5] DALEY R, 1972, 32 U CHIC I COMP RES

[6] DALEY R, 1977, J SYMBOLIC LOGIC, V41, P626

[7] EXTENT AND DENSITY OF SEQUENCES WITHIN MINIMAL-PROGRAM COMPLEXITY HIERARCHIES [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1974, 9 (02) : 151 - 163

[8] Katseff H. P., 1977, 18th Annual Symposium on Foundations of Computer Science, P82, DOI 10.1109/SFCS.1977.28

[9] KOLMOGOROV A. N., 1965, PROBL PEREDACHI INF, V1, P3

[10] A NEW INTERPRETATION OF VON MISES CONCEPT OF RANDOM SEQUENCE [J]. ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DER MATHEMATIK, 1966, 12 (04): : 279 - &