Combinatorial foundations of information theory and the calculus of probabilities
From MaRDI portal
Publication:3730704
DOI10.1070/RM1983v038n04ABEH004203zbMath0597.60002OpenAlexW1985224565MaRDI QIDQ3730704
Publication date: 1983
Published in: Russian Mathematical Surveys (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1070/rm1983v038n04abeh004203
Combinatorial probability (60C05) Measures of information, entropy (94A17) Axioms; other general questions in probability (60A05)
Related Items
Kolmogorov complexities \(K_{\max}\), \(K_{\min}\) on computable partially ordered sets, Intelligent forecasting with machine learning trading systems in chaotic intraday Bitcoin market, Thermodynamic equilibrium and rise of complexity in an accelerated universe, Kolmogorov complexity arguments in combinatorics, Conformal Prediction: A Gentle Introduction, Toward a dynamical model for prime numbers, A Note on Blum Static Complexity Measures, Estimate of the Hölder exponent based on the \(\epsilon\)-complexity of continuous functions, The dimensions of individual strings and sequences, Non-Algorithmic Theory of Randomness, Concentration theorems for entropy and free energy, MODELING QUANTUM MECHANICAL OBSERVERS VIA NEURAL-GLIAL NETWORKS, Well-calibrated predictions from on-line compression models, What is a complex system?, Statistical properties of finite sequences with high Kolmogorov complexity, Leveraging environmental correlations: the thermodynamics of requisite variety, Essential structure of proofs as a measure of complexity, Estimating the Hölder exponents based on the \(\epsilon \)-complexity of continuous functions: an experimental analysis of the algorithm, Distribution of investments in the stock market, information types, and algorithmic complexity, Disturbances and complexity in volatility time series, Kolmogorov's Last Discovery? (Kolmogorov and Algorithmic Statistics), Higher-order dangers and precisely constructed taxa in models of randomness, On the stability property of asymptotic laws of ergodic theory and universal compression schemes, Feasible reductions to Kolmogorov-Loveland stochastic sequences, On the Complexity and Dimension of Continuous Finite-Dimensional Maps, Physical complexity of symbolic sequences, On identification of stable systems and optimal approximation, Akaike's information criterion and recent developments in information complexity, New approach to the segmentation problem for time series of arbitrary nature, Algorithmic information for interval maps with an indifferent fixed point and infinite invariant measure, Inductive reasoning and Kolmogorov complexity, Unnamed Item, What is Shannon information?, Centroidal trajectories and frames for chaotic dynamical systems, On the concept of probability, Information and dynamical systems: A concrete measurement on sporadic dynamics, Shannon entropy rate of hidden Markov processes, Philosophical issues in Kolmogorov complexity, Computability and information in models of randomness and chaos, Ergodic theorems for individual random sequences, Testing randomness online, TIME AND A TEMPORALLY STATISTICAL QUANTUM GEOMETRODYNAMICS, Follow the math! : the mathematics of quantum mechanics as the mathematics of set partitions linearized to (Hilbert) vector spaces, Kolmogorov Complexity in Perspective Part I: Information Theory and Randomness, Model-free classification of panel data via the ϵ-complexity theory
