Information-theoretic computation complexity

DOI10.1109/TIT.1974.1055172MaRDI QIDQ4768625zbMATH OpenFDO

Authors Gregory J. Chaitin

Publication date 1974

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.1974.1055172

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Information theory (general) (94A15)

Cited in

(18)

• Towards the question of packet recovery at the transport layer
• Binary sequences. I: Complexity
• On interpreting Chaitin's incompleteness theorem
• On the capabilities of multilayer perceptrons
• Complexity analysis to explore the structure of ancient stromatolites
• MACRODYNAMIC COOPERATIVE COMPLEXITY OF BIOSYSTEMS
• Information-theoretic incompleteness
• Gödel's theorem and information
• A NEW TWO-DIMENSIONAL COMPLEXITY MEASURE
• Incompleteness theorems for random reals
• On the syntactic structure of protein sequences and the concept of grammar complexity
• A measure of shared information in classes of patterns
• Theory construction in psychology: The interpretation and integration of psychological data
• HIGHER ORDER COMPLEXITY OF TIME SERIES
• Probabilistic issues in statistical mechanics
• On proofs of the incompleteness theorems based on Berry's paradox by Vopěnka, Chaitin, and Boolos
• The representation and manipulation of the algorithmic probability measure for problem solving.
• Computability of entropy and information in classical Hamiltonian systems

This page was built for publication: Information-theoretic computation complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4768625)