Algorithmic Information Theory
From MaRDI portal
arithmetical incompletenessexponential diophantine equationhalting probabilityHilbert's tenth problem
Recursively (computably) enumerable sets and degrees (03D25) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Higher degree equations; Fermat's equation (11D41) Exponential Diophantine equations (11D61) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Algorithms in computer science (68W99) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02)
Recommendations
Cited in
(88)- The method of creative telescoping
- Information-theoretic incompleteness
- 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 numbers, Solovay machines, and Gödel incompleteness.
- A Chaitin number based on compressible strings
- The Borel-Cantelli lemmas, probability laws and Kolmogorov complexity
- From knowledge, knowability and the search for objective randomness to a new vision of complexity
- Algorithmic information dynamics of cellular automata
- Testing and mapping non-stationarity in animal behavioral processes: a case study on an individual female bean weevil
- The scope of Gödel's first incompleteness theorem
- Cryptography and algorithmic randomness
- Computability of probability measures and Martin-Löf randomness over metric spaces
- Differences of halting probabilities
- 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
- The universal path integral
- Information, randomness and incompleteness. Papers on algorithmic information theory
- Time and a temporally statistical quantum geometrodynamics
- 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
- State-size hierarchy for finite-state complexity
- Modeling quantum mechanical observers via neural-glial networks
- A statistical mechanical interpretation of algorithmic information theory. III: Composite systems and fixed points
- Rescuing Poincaré from Richard's paradox
- Lossless quantum data compression and quantum Kolmogorov complexity
- Preparation information and optimal decompositions for mixed quantum states
- Partial Randomness and Dimension of Recursively Enumerable Reals
- A general strategy for physics-based model validation illustrated with earthquake phenomenology, atmospheric radiative transfer, and computational fluid dynamics
- Algorithmic information theory
- Algorithmic information theory and its statistical mechanical interpretation
- The quest for Diophantine finite-fold-ness
- scientific article; zbMATH DE number 5081004 (Why is no real title available?)
- EXACT APPROXIMATIONS OF OMEGA NUMBERS
- THE SECOND QUANTIZED QUANTUM TURING MACHINE AND KOLMOGOROV COMPLEXITY
- SECOND QUANTIZED KOLMOGOROV COMPLEXITY
- Fractals generated by algorithmically random Brownian motion
- Chaitin numbers and halting problems
- 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
- Towards finite-fold Diophantine representations
- scientific article; zbMATH DE number 53549 (Why is no real title available?)
- Life as thermodynamic evidence of algorithmic structure in natural environments
- scientific article; zbMATH DE number 1222084 (Why is no real title available?)
- 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
- Impugning randomness, convincingly
- Schwarz, Wallace, and Rissanen: Intertwining Themes in Theories of Model Selection
- Relations between varieties of kolmogorov complexities
- scientific article; zbMATH DE number 1418484 (Why is no real title available?)
- Observations on computability, uncertainty, and technology
- Computability of convergence rates in the ergodic theorem for Martin-Löf random points
- The complexity of proving chaoticity and the Church-Turing thesis
- Information-Theoretic Incompleteness
- Computability and information in models of randomness and chaos
- Computing a Glimpse of Randomness
- Kolmogorov complexity and the geometry of Brownian motion
- Theory and Applications of Models of Computation
- Information Algebra
- Algorithmic information theory and undecidability
- Learning to Optimize
- Randomness as an invariant for number representations
- Information lattice learning
- Algorithmic information and simplicity in statistical physics
- Self-replicating sequences of binary numbers. Foundations. I: General
- Application of Chaitin's incompleteness theorem to quantum gravity
- A pluralist view about information
- Representation of left-computable \(\varepsilon \)-random reals
- Finite state complexity
- Between order and chaos: The quest for meaningful information
- What can and cannot be done with Diophantine problems
- Analytic and combinatoric aspects of Hurwitz polyzetas
- A new version of algorithmic information theory.
- Exploring the dynamics of dyadic interactions via hierarchical segmentation
This page was built for publication: Algorithmic Information Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3802576)
