ON DIFFICULTY OF COMPUTATIONS

[1] ARBIB M, 1965, P AM MATH SOC, V16, P442

[2] ARBIB MA, THEORIES ABSTRACT AU

[3] A MACHINE-INDEPENDENT THEORY OF COMPLEXITY OF RECURSIVE FUNCTIONS [J]. JOURNAL OF THE ACM, 1967, 14 (02) : 322 - &

[4] ON SIMPLICITY AND SPEED OF PROGRAMS FOR COMPUTING INFINITE SETS OF NATURAL NUMBERS [J]. JOURNAL OF THE ACM, 1969, 16 (03) : 407 - &

[5] ON LENGTH OF PROGRAMS FOR COMPUTING FINITE BINARY SEQUENCES - STATISTICAL CONSIDERATIONS [J]. JOURNAL OF THE ACM, 1969, 16 (01) : 145 - &

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

[7] DAVIS M, 1962, P S PURE MATHEMATICS, V5, P135

[8] Davis M., 1958, COMPUTABILITY UNSOLV

[9] DAVIS M, 1963, P S MATHEMATICAL THE, P15

[10] Davis Martin., 1965, UNDECIDABLE BASIC PA

[1] ARBIB M, 1965, P AM MATH SOC, V16, P442

[2] ARBIB MA, THEORIES ABSTRACT AU

[3] A MACHINE-INDEPENDENT THEORY OF COMPLEXITY OF RECURSIVE FUNCTIONS [J]. JOURNAL OF THE ACM, 1967, 14 (02) : 322 - &

[4] ON SIMPLICITY AND SPEED OF PROGRAMS FOR COMPUTING INFINITE SETS OF NATURAL NUMBERS [J]. JOURNAL OF THE ACM, 1969, 16 (03) : 407 - &

[5] ON LENGTH OF PROGRAMS FOR COMPUTING FINITE BINARY SEQUENCES - STATISTICAL CONSIDERATIONS [J]. JOURNAL OF THE ACM, 1969, 16 (01) : 145 - &

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

[7] DAVIS M, 1962, P S PURE MATHEMATICS, V5, P135

[8] Davis M., 1958, COMPUTABILITY UNSOLV

[9] DAVIS M, 1963, P S MATHEMATICAL THE, P15

[10] Davis Martin., 1965, UNDECIDABLE BASIC PA