Information-theoretic computation complexity
From MaRDI portal
Publication:4768625
DOI10.1109/TIT.1974.1055172zbMath0282.68022MaRDI QIDQ4768625
Publication date: 1974
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items (17)
Complexity analysis to explore the structure of ancient stromatolites ⋮ A NEW TWO-DIMENSIONAL COMPLEXITY MEASURE ⋮ The representation and manipulation of the algorithmic probability measure for problem solving. ⋮ On proofs of the incompleteness theorems based on Berry's paradox by Vopěnka, Chaitin, and Boolos ⋮ On the capabilities of multilayer perceptrons ⋮ Incompleteness theorems for random reals ⋮ A measure of shared information in classes of patterns ⋮ Theory construction in psychology: The interpretation and integration of psychological data ⋮ Probabilistic issues in statistical mechanics ⋮ Computability of entropy and information in classical Hamiltonian systems ⋮ Information-theoretic incompleteness ⋮ HIGHER ORDER COMPLEXITY OF TIME SERIES ⋮ MACRODYNAMIC COOPERATIVE COMPLEXITY OF BIOSYSTEMS ⋮ Gödel's theorem and information ⋮ On interpreting Chaitin's incompleteness theorem ⋮ Binary sequences. I: Complexity ⋮ On the syntactic structure of protein sequences and the concept of grammar complexity
This page was built for publication: Information-theoretic computation complexity
