Three approaches to the quantitative definition of information*

Cited in

(67)

High resolution quantization and entropy coding of jump processes
The coding complexity of Lévy processes
Modeling by shortest data description
Strategies for managing the structural and dynamic consequences of project complexity
An approach of randomness of a sample based on its weak ergodic limit
On measuring the complexity of networks: Kolmogorov complexity versus entropy
A computable measure of algorithmic probability by finite approximations with an application to integer sequences
The unifying frameworks of information measures
Randomness and reducibility
Representations and divergences in the space of probability measures and stochastic thermodynamics
How complex is a random picture?
On the possibility of basing cryptography on \(\mathsf{EXP}\ne \mathsf{BPP} \)
The soccer game, bit by bit: an information-theoretic analysis
The Fisher-DisEn plane: a novel approach to distinguish different complex systems
A novel approach to the study of spatio-temporal brain dynamics using change-based complexity
On the computational power of random strings
Searching for shortest and least programs
VC-based confidence and credibility for support vector machines
Enumerations including laconic enumerators
On graph entropy measures based on the number of independent sets and matchings
Information entropy as a basic building block of complexity theory
Development of metrics and a complexity scale for the topology of assembly supply chains
Universal ideal behavior and macroscopic work relation of linear irreversible stochastic thermodynamics
On the complexity of some geometrical objects
On initial segment complexity and degrees of randomness
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
An inductive inference approach to classification
Information geometric methods for complexity
An incompressibility theorem for automatic complexity
*-Lie algebras canonically associated to probability measures on R with all moments
Information density, structure and entropy in equilibrium and non-equilibrium systems
Non-isometric quantum error correction in gravity
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
NP-hardness of approximating meta-complexity: a cryptographic approach
Indistinguishability obfuscation, range avoidance, and bounded arithmetic
Dispersion complexity-entropy curves: an effective method to characterize the structures of nonlinear time series
Complexity and disequilibrium in the dipole-type Hamiltonian mean-field model
Entropy measures vs. Kolmogorov complexity
Quantum Kolmogorov complexity and information-disturbance theorem
Algorithmic relative complexity
On one-way functions and sparse languages
Maslov rank distributions for the analysis of two-dimensional and quasi-two-dimensional turbulent flows
A direct PRF construction from Kolmogorov complexity
Complexity of quantum-mechanical evolutions from probability amplitudes
On witness encryption and laconic zero-knowledge arguments
Quantum cryptography and meta-complexity
Hardness along the boundary: towards one-way functions from the worst-case hardness of time-bounded Kolmogorov complexity
Gap MCSP is not (Levin) NP-complete in obfustopia
Search-to-decision reductions for Kolmogorov complexity
The non-uniform perebor conjecture for time-bounded Kolmogorov complexity is false
On black-box meta complexity and function inversion
NP-hardness of approximating meta-complexity: a cryptographic approach
Application of Chaitin's incompleteness theorem to quantum gravity
Bandwidth of timed automata: 3 classes
Substring complexity in sublinear space
On one-way functions, the worst-case hardness of time-bounded Kolmogorov complexity, and computational depth
Digital world, mathematics, and education
A meta-complexity theoretic approach to indistinguishability obfuscation and witness pseudo-canonicalization
Weighing obese timed languages
The subsequence composition of a string
Hydrozip: how hydrological knowledge can be used to improve compression of hydrological data
Analysis of time series through complexity-entropy curves based on generalized fractional entropy
Causal discovery in heavy-tailed models

This page was built for publication: Three approaches to the quantitative definition of information^*

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