Algorithmic Information Theory
From MaRDI portal
Publication:4137091
DOI10.1147/RD.214.0350zbMATH Open0362.94035OpenAlexW2567782165WikidataQ56603536 ScholiaQ56603536MaRDI QIDQ4137091FDOQ4137091
Authors: Gregory J. Chaitin 
Publication date: 1977
Published in: IBM Journal of Research and Development (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1147/rd.214.0350
Cited In (53)
- Kolmogorov's Last Discovery? (Kolmogorov and Algorithmic Statistics)
- Observation of Unbounded Novelty in Evolutionary Algorithms is Unknowable
- Inexactness and a future of computing
- Enhancement of coping through blurring
- Recursively enumerable reals and Chaitin \(\Omega\) numbers
- Universal recursively enumerable sets of strings
- BRILLOUIN AND THE CONCEPT OF INFORMATION
- On explicating the concept `the power of an arithmetical theory'
- A new quantum random number generator certified by value indefiniteness
- On interpreting Chaitin's incompleteness theorem
- Remarks on string-matching and one-way multihead automata
- Information theory: A multifaceted model of information
- Computing from projections of random points
- Probabilities over rich languages, testing and randomness
- Binary Pseudo-Random Sequences Theory
- STRONG JUMP-TRACEABILITY
- On randomness, determinism and computability
- Two more characterizations of \(K\)-triviality
- Information-theoretic incompleteness
- Low upper bounds of ideals
- Randomness and reducibility
- Gödel's theorem and information
- Choice and complexity
- Bi-immunity over different size alphabets
- Algorithmic Statistics Revisited
- Inherent enumerability of strong jump-traceability
- Tape versus queue and stacks: The lower bounds
- Undecidability and incompleteness in classical mechanics
- The asymptotic equipartition property in reinforcement learning and its relation to return maximization
- Lowness for effective Hausdorff dimension
- RELATIVIZING CHAITIN'S HALTING PROBABILITY
- The arrow of time and meaning
- Turing incomparability in Scott sets
- Mathematics as information compression via the matching and unification of patterns
- The Whole and the Parts: The Minimum Description Length Principle and the A-Contrario Framework
- Unified characterizations of lowness properties via Kolmogorov complexity
- Chaitin \(\Omega\) numbers, Solovay machines, and Gödel incompleteness.
- Universal Recursively Enumerable Sets of Strings
- Accuracy, scope, and flexibility of models
- Syntactic compression codes at the zero entropy point
- Informational branching universe
- Relationship between electron flux and electron complexity in a disordered Dirac comb
- Randomness and the linear degrees of computability
- Universal computation and physical dynamics
- Schnorr trivial reals: a construction
- Schnorr Trivial Reals: A construction
- Computation theory of cellular automata
- Square time is optimal for simulation of one pushdown store or one queue by an oblivious one-head tape unit
- An \(n^{1.618}\) lower bound on the time to simulate one queue or two pushdown stores by one tape
- Nonlinear phenomena in spaces of algorithms
- On two-tape real-time computation and queues
- The metalogic of economic predictions, calculations and propositions
- A characterization of c. e. random reals
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 Q4137091)
