ALGORITHMIC INFORMATION-THEORY

被引:146
作者
CHAITIN, GJ [1 ]
机构
[1] IBM CORP,THOMAS J WATSON RES CTR,YORKTOWN HTS,NY 10598
关键词
D O I
10.1147/rd.214.0350
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:350 / 359
页数:10
相关论文
共 58 条
[1]   LOGICAL REVERSIBILITY OF COMPUTATION [J].
BENNETT, CH .
IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1973, 17 (06) :525-532
[2]  
BENNETT CH, THERMODYNAMICS COMPU
[3]  
Chaitin G., 1970, ACM SICACT NEWS, V4, P12, DOI [10.1145/1247047.1247052, DOI 10.1145/1247047.1247052]
[4]  
Chaitin G. J., 1976, Computers & Mathematics with Applications, V2, P233, DOI 10.1016/0898-1221(76)90016-X
[5]  
Chaitin G. J., 1976, Theoretical Computer Science, V2, P45, DOI 10.1016/0304-3975(76)90005-0
[6]   ON SIMPLICITY AND SPEED OF PROGRAMS FOR COMPUTING INFINITE SETS OF NATURAL NUMBERS [J].
CHAITIN, GJ .
JOURNAL OF THE ACM, 1969, 16 (03) :407-&
[7]   INFORMATION-THEORETIC COMPUTATIONAL COMPLEXITY [J].
CHAITIN, GJ .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1974, 20 (01) :10-15
[8]   INFORMATION-THEORETIC LIMITATIONS OF FORMAL SYSTEMS [J].
CHAITIN, GJ .
JOURNAL OF THE ACM, 1974, 21 (03) :403-424
[9]   ON DIFFICULTY OF COMPUTATIONS [J].
CHAITIN, GJ .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1970, 16 (01) :5-+
[10]   RANDOMNESS AND MATHEMATICAL PROOF [J].
CHAITIN, GJ .
SCIENTIFIC AMERICAN, 1975, 232 (05) :47-52