Algorithmic Information Theory

94-02: Research exposition (monographs, survey articles) pertaining to information and communication theory

68-02: Research exposition (monographs, survey articles) pertaining to computer science

11D61: Exponential Diophantine equations

11D41: Higher degree equations; Fermat's equation

03D25: Recursively (computably) enumerable sets and degrees

68W99: Algorithms in computer science

03D60: Computability and recursion theory on ordinals, admissible sets, etc.

Related Items

A test for randomness based on a complexity measure, Algorithmic complexity of points in dynamical systems, Responses to ``Theoretical Mathematics: Toward\\ a cultural synthesis of mathematics and\\ theoretical physics, by A. Jaffe and F. Quinn, Asymptotic prime-power divisibility of binomial, generalized binomial, and multinomial coefficients, Complexity and meaning in nonlinear dynamical systems, Schwarz, Wallace, and Rissanen: Intertwining Themes in Theories of Model Selection, Relations between varieties of kolmogorov complexities, Computability and information in models of randomness and chaos, Computing a Glimpse of Randomness, Algorithmic information and simplicity in statistical physics, Self-replicating sequences of binary numbers. Foundations. I: General, Between order and chaos: The quest for meaningful information, Analytic and combinatoric aspects of Hurwitz polyzetas, The method of creative telescoping, A comparative classification of complexity measures, Identifying randomness given by high descriptive complexity, Four encounters with Sierpiński's gasket, Physical versus computational complementarity. I, Hamiltonian chaos in the interaction of moving two-level atoms with cavity vacuum, The descriptive complexity of Brownian motion, Chaitin \(\Omega\) numbers, Solovay machines, and Gödel incompleteness., The Borel-Cantelli lemmas, probability laws and Kolmogorov complexity, From knowledge, knowability and the search for objective randomness to a new vision of complexity, Computability of probability measures and Martin-Löf randomness over metric spaces, Random reals à la Chaitin with or without prefix-freeness, The mathematical universe, The asymptotic equipartition property in reinforcement learning and its relation to return maximization, Preparation information and optimal decompositions for mixed quantum states, Partial Randomness and Dimension of Recursively Enumerable Reals, EXACT APPROXIMATIONS OF OMEGA NUMBERS, THE SECOND QUANTIZED QUANTUM TURING MACHINE AND KOLMOGOROV COMPLEXITY, SECOND QUANTIZED KOLMOGOROV COMPLEXITY, ECONOPHYSICS AND ECONOMIC COMPLEXITY, Fixed Point Theorems on Partial Randomness, On universal computably enumerable prefix codes, Philosophical Conceptions of Information, Information: The Algorithmic Paradigm, Kolmogorov-Complexity Based on Infinite Computations