Algorithmic Information Theory

Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Exponential Diophantine equations (11D61) Higher degree equations; Fermat's equation (11D41) Recursively (computably) enumerable sets and degrees (03D25) Algorithms in computer science (68W99) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items

The Borel-Cantelli lemmas, probability laws and Kolmogorov complexity, The universal path integral, From knowledge, knowability and the search for objective randomness to a new vision of complexity, A Note on Blum Static Complexity Measures, A Program-Size Complexity Measure for Mathematical Problems and Conjectures, Invariance and Universality of Complexity, Phase Transition between Unidirectionality and Bidirectionality, Computability of convergence rates in the ergodic theorem for Martin-Löf random points, Four encounters with Sierpiński's gasket, STATE-SIZE HIERARCHY FOR FINITE-STATE COMPLEXITY, A test for randomness based on a complexity measure, Partial Randomness and Dimension of Recursively Enumerable Reals, Computability of probability measures and Martin-Löf randomness over metric spaces, MODELING QUANTUM MECHANICAL OBSERVERS VIA NEURAL-GLIAL NETWORKS, A statistical mechanical interpretation of algorithmic information theory III: composite systems and fixed points, Algorithmic complexity of points in dynamical systems, A General Strategy for Physics-Based Model Validation Illustrated with Earthquake Phenomenology, Atmospheric Radiative Transfer, and Computational Fluid Dynamics, Schwarz, Wallace, and Rissanen: Intertwining Themes in Theories of Model Selection, Differences of halting probabilities, Responses to ``Theoretical Mathematics: Toward\\ a cultural synthesis of mathematics and\\ theoretical physics, by A. Jaffe and F. Quinn, Physical versus computational complementarity. I, Towards finite-fold Diophantine representations, The quest for Diophantine finite-fold-ness, Life as thermodynamic evidence of algorithmic structure in natural environments, Learning to Optimize, Testing and mapping non-stationarity in animal behavioral processes: a case study on an individual female bean weevil, Randomness as an invariant for number representations, EXACT APPROXIMATIONS OF OMEGA NUMBERS, Rescuing Poincaré from Richard’s Paradox, THE SECOND QUANTIZED QUANTUM TURING MACHINE AND KOLMOGOROV COMPLEXITY, Impugning randomness, convincingly, Relations between varieties of kolmogorov complexities, SECOND QUANTIZED KOLMOGOROV COMPLEXITY, The method of creative telescoping, Analytic and combinatoric aspects of Hurwitz polyzetas, Random reals à la Chaitin with or without prefix-freeness, Algorithmic information theory and its statistical mechanical interpretation, Asymptotic prime-power divisibility of binomial, generalized binomial, and multinomial coefficients, Algorithmic information and simplicity in statistical physics, LOSSLESS QUANTUM DATA COMPRESSION AND QUANTUM KOLMOGOROV COMPLEXITY, Self-replicating sequences of binary numbers. Foundations. I: General, Fractals Generated by Algorithmically Random Brownian Motion, Chaitin Ω Numbers and Halting Problems, The scope of Gödel's first incompleteness theorem, The mathematical universe, Complexity and meaning in nonlinear dynamical systems, A Chaitin \(\Omega\) number based on compressible strings, Kolmogorov complexity and the geometry of Brownian motion, The asymptotic equipartition property in reinforcement learning and its relation to return maximization, Representation of left-computable \(\varepsilon \)-random reals, Exploring the dynamics of dyadic interactions via hierarchical segmentation, Finite state complexity, ECONOPHYSICS AND ECONOMIC COMPLEXITY, Fixed Point Theorems on Partial Randomness, On universal computably enumerable prefix codes, Between order and chaos: The quest for meaningful information, Computability and information in models of randomness and chaos, What can and cannot be done with Diophantine problems, Philosophical Conceptions of Information, Information: The Algorithmic Paradigm, Computing a Glimpse of Randomness, Kolmogorov-Complexity Based on Infinite Computations, TIME AND A TEMPORALLY STATISTICAL QUANTUM GEOMETRODYNAMICS, Hamiltonian chaos in the interaction of moving two-level atoms with cavity vacuum, Algorithmic information dynamics of cellular automata, The complexity of proving chaoticity and the Church–Turing thesis, The descriptive complexity of Brownian motion, Observations on Computability, Uncertainty, and Technology, Chaitin \(\Omega\) numbers, Solovay machines, and Gödel incompleteness., A comparative classification of complexity measures, Cryptography and algorithmic randomness, Identifying randomness given by high descriptive complexity, Preparation information and optimal decompositions for mixed quantum states