Algorithmic Information Theory
From MaRDI portal
(Redirected from Publication:4137091)
Algorithmic Information Theory (scientific article; zbMATH DE number 3564868)
Algorithmic Information Theory (scientific article; zbMATH DE number 3564868)
Cited in
(57)- 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
- Computation theory of cellular automata
- Remarks on string-matching and one-way multihead automata
- Tape versus queue and stacks: The lower bounds
- On randomness, determinism and computability
- The metalogic of economic predictions, calculations and propositions
- Undecidability and incompleteness in classical mechanics
- Information-theoretic incompleteness
- Enhancement of coping through blurring
- On interpreting Chaitin's incompleteness theorem
- Information theory: A multifaceted model of information
- Chaitin numbers, Solovay machines, and Gödel incompleteness.
- Two more characterizations of \(K\)-triviality
- Gödel's theorem and information
- Randomness and reducibility
- Universal computation and physical dynamics
- Accuracy, scope, and flexibility of models
- A new quantum random number generator certified by value indefiniteness
- Relationship between electron flux and electron complexity in a disordered Dirac comb
- Bi-immunity over different size alphabets
- Mathematics as information compression via the matching and unification of patterns
- Unified characterizations of lowness properties via Kolmogorov complexity
- The arrow of time and meaning
- On explicating the concept `the power of an arithmetical theory'
- The asymptotic equipartition property in reinforcement learning and its relation to return maximization
- Algorithmic statistics revisited
- Inexactness and a future of computing
- BRILLOUIN AND THE CONCEPT OF INFORMATION
- Binary Pseudo-Random Sequences Theory
- RELATIVIZING CHAITIN'S HALTING PROBABILITY
- Universal Recursively Enumerable Sets of Strings
- Low upper bounds of ideals
- Syntactic compression codes at the zero entropy point
- Probabilities over rich languages, testing and randomness
- Nonlinear phenomena in spaces of algorithms
- Strong jump-traceability
- Schnorr Trivial Reals: A construction
- The whole and the parts: the minimum description length principle and the a-contrario framework
- Computing from projections of random points
- Lowness for effective Hausdorff dimension
- Turing incomparability in Scott sets
- Universal recursively enumerable sets of strings
- Inherent enumerability of strong jump-traceability
- Choice and complexity
- Observation of Unbounded Novelty in Evolutionary Algorithms is Unknowable
- Recursively enumerable reals and Chaitin \(\Omega\) numbers
- A characterization of c. e. random reals
- Kolmogorov's Last Discovery? (Kolmogorov and Algorithmic Statistics)
- Information theory for complex systems scientists: what, why, and how
- Stability-driven assembly theory
- The info-computation turn in physics
- Kolmogorov complexity in the USSR (1975--1982): isolation and its end
- On two-tape real-time computation and queues
- Randomness and the linear degrees of computability
- Schnorr trivial reals: a construction
- Informational branching universe
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)
