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