ON DIFFICULTY OF COMPUTATIONS

被引：21
作者：
CHAITIN, GJ
机构：
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 1970年 / 16卷 / 01期
关键词：
D O I：
10.1109/TIT.1970.1054390
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：5 / +
相关论文
共 25 条
[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].
BLUM, M .
JOURNAL OF THE ACM, 1967, 14 (02) :322-&
[4]   ON SIMPLICITY AND SPEED OF PROGRAMS FOR COMPUTING INFINITE SETS OF NATURAL NUMBERS [J].
CHAITIN, GJ .
JOURNAL OF THE ACM, 1969, 16 (03) :407-&
[5]   ON LENGTH OF PROGRAMS FOR COMPUTING FINITE BINARY SEQUENCES - STATISTICAL CONSIDERATIONS [J].
CHAITIN, GJ .
JOURNAL OF THE ACM, 1969, 16 (01) :145-&
[6]   ON LENGTH OF PROGRAMS FOR COMPUTING FINITE BINARY SEQUENCES [J].
CHAITIN, GJ .
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
123