THEORY OF PROGRAM SIZE FORMALLY IDENTICAL TO INFORMATION-THEORY

被引：468

作者：

CHAITIN, GJ ^{[1
]}

机构：

[1] IBM CORP,THOMAS J WATSON RES CTR,YORKTOWN HEIGHTS,NY

来源：

关键词：

D O I：

10.1145/321892.321894

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：329 / 340

页数：12

共 33 条

[1]

ABRAMSON N, 1963, INFORMATION THEORY C

[2]

ASH R, 1965, INFORMATION THEORY

[3] LOGICAL REVERSIBILITY OF COMPUTATION [J].

BENNETT, CH .

[4] INFORMATION-THEORETIC COMPUTATIONAL COMPLEXITY [J].

CHAITIN, GJ .

[5] INFORMATION-THEORETIC LIMITATIONS OF FORMAL SYSTEMS [J].

CHAITIN, GJ .

[6] ON DIFFICULTY OF COMPUTATIONS [J].

CHAITIN, GJ .

CHAITIN, GJ .

[8] ON LENGTH OF PROGRAMS FOR COMPUTING FINITE BINARY SEQUENCES [J].

CHAITIN, GJ .

[9]

CHAITIN GJ, IN PRESS

[10]

CHAITIN GJ, TO BE PUBLISHED