Information-theoretic Limitations of Formal Systems

Information-theoretic Limitations of Formal Systems (1974)

by Gregory J. Chaitin , G. J. Chaitin

Venue:	Journal of the ACM
Citations:	43 - 7 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Information-theoretic Limitations of Formal Systems	INFERENCE
AUTHOR NAME	Gregory J. Chaitin	SVM HeaderParse 0.1
AUTHOR AFFIL	1	SVM HeaderParse 0.2
AUTHOR ADDR	Buenos Aires, Argentina	SVM HeaderParse 0.1
AUTHOR NAME	G. J. Chaitin	SVM HeaderParse 0.1
AUTHOR AFFIL	Key Words and Phrases:	SVM HeaderParse 0.2
ABSTRACT	An attempt is made to apply information-theoretic computational complexity to metamathematics. The paper studies the number of bits of instructions that must be a given to a computer for it to perform finite and infinite tasks, and also the amount of time that it takes the computer to perform these tasks. This is applied to measuring the difficulty of proving a given set of theorems, in terms of the number of bits of axioms that are assumed, and the size of the proofs needed to deduce the theorems from the axioms. 2 G. J. Chaitin Key Words and Phrases: complexity of sets, computational complexity, difficulty of theoremproving, entropy of sets, formal systems, Godel's incompleteness theorem, halting problem, information content of sets, information content of axioms, information theory, information time trade-offs, metamathematics, random strings, recursive functions, recursively enumerable sets, size of proofs, universal computers CR Categories: 5.21, 5.25, 5.27, 5.6 1. Introduct...	user correction - Legacy Corrections
YEAR	1974	INFERENCE
VENUE	Journal of the ACM	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	403--424	INFERENCE
VOLUME	21	INFERENCE
CITATIONS	42 found	ParsCit 1.0