scientific article; zbMATH DE number 1911266
From MaRDI portal
Publication:4806962
zbMath1055.68058MaRDI QIDQ4806962
Publication date: 15 May 2003
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Information theory (general) (94A15) Applications of computability and recursion theory (03D80)
Related Items
A Quest for Algorithmically Random Infinite Structures, II, A Program-Size Complexity Measure for Mathematical Problems and Conjectures, On Degrees of Randomness and Genetic Randomness, Learning Families of Closed Sets in Matroids, Invariance and Universality of Complexity, Phase Transition between Unidirectionality and Bidirectionality, Effectivity questions for Kleene's recursion theorem, Initial segment complexities of randomness notions, The Kolmogorov complexity of infinite words, Incomparability, entropy, and mixing dynamics, Is complexity a source of incompleteness?, Gacs quantum algorithmic entropy in infinite dimensional Hilbert spaces, Algorithmic thermodynamics, Natural halting probabilities, partial randomness, and zeta functions, Bohmian mechanics is not deterministic, The deluge of spurious correlations in big data, Walking on real numbers, Unpredictability and Computational Irreducibility, Open problems in universal induction \& intelligence, Entropy and algorithmic complexity in quantum information theory, On the Unpredictability of Individual Quantum Measurement Outcomes, A computation model with automatic functions and relations as primitive operations, The principles of informational genomics, Simplicity via provability for universal prefix-free Turing machines, Lempel-Ziv complexity analysis of one dimensional cellular automata, Kurt Gödel's Anticipation of the Turing Machine: A Vitalistic Approach, A Pseudo-Random Generator Whose Output is a Normal Sequence, Exact constructive and computable dimensions, Is there a universal image generator?, Base invariance of feasible dimension, Universal Recursively Enumerable Sets of Strings, Algorithmically Independent Sequences, Covering the recursive sets, An Empirical Approach to the Normality of π, Bi-immunity over different size alphabets, Inductive Complexity of P versus NP Problem, Numerical evaluation of algorithmic complexity for short strings: a glance into the innermost structure of randomness, Random numbers as probabilities of machine behavior, On the logical structure of de Finetti's notion of event, A new quantum random number generator certified by value indefiniteness, A Kolmogorov complexity proof of the Lovász local lemma for satisfiability, On Oscillation-free ε-random Sequences, Algorithmically independent sequences, Universal recursively enumerable sets of strings, Most programs stop quickly or never halt, Quantum value indefiniteness, Kolmogorov Complexity of Categories, On Martin-Löf Convergence of Solomonoff’s Mixture, Computational universes, Time-universal data compression, The Dynamics of Cellular Automata in Shift-Invariant Topologies, Randomness relative to Cantor expansions, The complexity of Euler's integer partition theorem, Representation of left-computable \(\varepsilon \)-random reals, An empirical study of the complexity and randomness of prediction error sequences, On the non-randomness of maximum Lempel Ziv complexity sequences of finite size, Finite state complexity, Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks, Liouville, computable, Borel normal and Martin-Löf random numbers, Prefix-free quantum Kolmogorov complexity, Searching for shortest and least programs, On universal computably enumerable prefix codes, Information: The Algorithmic Paradigm, From Heisenberg to Gödel via Chaitin, From Heisenberg to Gödel via Chaitin, Formal Proof: Reconciling Correctness and Understanding, The complexity of the four colour theorem, Randomness and initial segment complexity for measures, Incompleteness and the halting problem, Classical, quantum and biological randomness as relative unpredictability, Unnamed Item, A topological characterization of random sequences, Algorithmic networks: central time to trigger expected emergent open-endedness, Algorithmic information dynamics of cellular automata, On partial randomness, On trees without hyperimmune branches, On Martin-Löf (non-)convergence of Solomonoff's universal mixture, Turing patterns with Turing machines: emergence and low-level structure formation, Finite state incompressible infinite sequences
