Logical basis for information theory and probability theory
From MaRDI portal
Publication:5554774
DOI10.1109/TIT.1968.1054210zbMath0167.47601WikidataQ56038298 ScholiaQ56038298MaRDI QIDQ5554774
Publication date: 1968
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items
COMPUTERIZED METHODOLOGY FOR THE EVALUATION OF LEVEL OF KNOWLEDGE, A test for randomness based on a complexity measure, Entropy estimation of symbol sequences, Counting probability distributions: Differential geometry and model selection, Regression Estimation from an Individual Stable Sequence, A theory of information structure I. General principles, A quantitative Occam's razor, Links between physics and set theory., Well-calibrated predictions from on-line compression models, Entropy and algorithmic complexity in quantum information theory, A spectrum of compromise aggregation operators for multi-attribute decision making, On the relation between descriptional complexity and algorithmic probability, Uncontrollable computational growth in theoretical physics, A measure of shared information in classes of patterns, On grammars, complexity, and information measures of biological macromolecules, Organization by rules in finite sequences, Randomness, independence, and hypotheses, Model discrimination using an algorithmic information criterion, Mathematical metaphysics of randomness, Ergodic theorems for individual random sequences, Computational depth and reducibility, The discovery of algorithmic probability, On the computational complexity of infinite words., Relationship of second-order lacunarity, Hurst exponent, Brownian motion, and pattern organization, Quantitative and qualitative growth analysis, Inequalities for Shannon entropy and Kolmogorov complexity, A study of the fractal character in electronic noise processes, Limit complexities revisited, Accuracy, scope, and flexibility of models, The importance of complexity in model selection, Concentration theorems for entropy and free energy, Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem, Traffic grammar and algorithmic complexity in urban freeway flow patterns, Measures of ignorance, information and uncertainty. I, On the application of algorithmic information theory to decision problems, Quantum Algorithmic Complexities and Entropy, One or Many Concepts of Information?, Unnamed Item, Kolmogorov and mathematical logic, Minimal-program complexity of pseudo-recursive and pseudo-random sequences, SYSTEM IDENTIFICATION, APPROXIMATION AND COMPLEXITY, SYSTEMS AND DISTINCTIONS; DUALITY AND COMPLEMENT ARITY†
