Three approaches to the quantitative definition of information*
From MaRDI portal
Publication:5558743
DOI10.1080/00207166808803030zbMath0172.42701OpenAlexW2005097301MaRDI QIDQ5558743
Publication date: 1968
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207166808803030
Related Items
On the possibility of basing cryptography on \(\mathsf{EXP}\ne \mathsf{BPP} \) ⋮ Causal discovery in heavy-tailed models ⋮ $$*$$ ∗ –Lie Algebras Canonically Associated to Probability Measures on $${\pmb {\varvec{\mathbb {R}}}}$$ R with All Moments ⋮ Randomness and reducibility ⋮ Information entropy as a basic building block of complexity theory ⋮ Development of metrics and a complexity scale for the topology of assembly supply chains ⋮ On the Complexity of Some Geometrical Objects ⋮ Strategies for managing the structural and dynamic consequences of project complexity ⋮ An inductive inference approach to classification ⋮ An approach of randomness of a sample based on its weak ergodic limit ⋮ Information geometric methods for complexity ⋮ VC-based confidence and credibility for support vector machines ⋮ The soccer game, bit by bit: an information-theoretic analysis ⋮ On graph entropy measures based on the number of independent sets and matchings ⋮ Enumerations including laconic enumerators ⋮ Modeling by shortest data description ⋮ Non-isometric quantum error correction in gravity ⋮ On measuring the complexity of networks: Kolmogorov complexity versus entropy ⋮ Disentangling complexity from randomness and chaos ⋮ Temperature effects, Frieden-Hawkins' order-measure, and Wehrl entropy ⋮ Life as thermodynamic evidence of algorithmic structure in natural environments ⋮ On initial segment complexity and degrees of randomness ⋮ A computable measure of algorithmic probability by finite approximations with an application to integer sequences ⋮ One-way functions and the hardness of (probabilistic) time-bounded Kolmogorov complexity w.r.t. samplable distributions ⋮ Kolmogorov's Last Discovery? (Kolmogorov and Algorithmic Statistics) ⋮ Analysis of time series in the cumulative residual entropy plane based on oscillation roughness exponent ⋮ The Fisher-DisEn plane: a novel approach to distinguish different complex systems ⋮ The unifying frameworks of information measures ⋮ Entropy measures vs. Kolmogorov complexity ⋮ Quantum Kolmogorov complexity and information-disturbance theorem ⋮ Algorithmic relative complexity ⋮ An incompressibility theorem for automatic complexity ⋮ Representations and divergences in the space of probability measures and stochastic thermodynamics ⋮ A novel approach to the study of spatio-temporal brain dynamics using change-based complexity ⋮ How complex is a random picture? ⋮ On the computational power of random strings ⋮ Searching for shortest and least programs ⋮ The subsequence composition of a string ⋮ Hydrozip: how hydrological knowledge can be used to improve compression of hydrological data ⋮ On algorithmic statistics for space-bounded algorithms ⋮ Universal ideal behavior and macroscopic work relation of linear irreversible stochastic thermodynamics ⋮ High resolution quantization and entropy coding of jump processes ⋮ The coding complexity of Lévy processes ⋮ Analysis of time series through complexity-entropy curves based on generalized fractional entropy ⋮ Information density, structure and entropy in equilibrium and non-equilibrium systems
