scientific article; zbMATH DE number 1010621
From MaRDI portal
Publication:4337021
zbMath0866.68051MaRDI QIDQ4337021
Publication date: 19 May 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexitydata compressionKolmogorov complexitycomputational learninginstance complexitycircuit theoryuniversal predictionCD compressiondistributed algorithmicsKolmogorov random graphsshortest encoding
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Probability and inductive logic (03B48) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Foundations of equilibrium statistical mechanics (82B03) Measures of information, entropy (94A17) Axioms; other general questions in probability (60A05)
Related Items (only showing first 100 items - show all)
Heuristic, systematic, and informational regularization for process monitoring ⋮ Effective fractal dimensions ⋮ Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring ⋮ Invariance and Universality of Complexity ⋮ Multiple Usage of Random Bits in Finite Automata ⋮ The average‐case area of Heilbronn‐type triangles* ⋮ On proofs of the incompleteness theorems based on Berry's paradox by Vopěnka, Chaitin, and Boolos ⋮ On the Complexity of Some Geometrical Objects ⋮ Turing incomparability in Scott sets ⋮ Individual communication complexity ⋮ Pseudorandom number generator based on the Bernoulli map on cubic algebraic integers ⋮ Schnorr randomness ⋮ On the construction of effectively random sets ⋮ There is no SW-complete c.e. real ⋮ The Relevance of Computation Irreducibility as Computation Universality in Economics ⋮ Unpredictability and Computational Irreducibility ⋮ Competitive On-line Statistics ⋮ EXACT PAIRS FOR THE IDEAL OF THEK-TRIVIAL SEQUENCES IN THE TURING DEGREES ⋮ Constructive reinforcement learning ⋮ USING ALMOST-EVERYWHERE THEOREMS FROM ANALYSIS TO STUDY RANDOMNESS ⋮ DECISION TREES DO NOT GENERALIZE TO NEW VARIATIONS ⋮ Pseudorandom number generation using chaotic true orbits of the Bernoulli map ⋮ Generation Complexity Versus Distinction Complexity ⋮ Complex tilings ⋮ Dimensions of Points in Self-similar Fractals ⋮ On Characteristic Constants of Theories Defined by Kolmogorov Complexity ⋮ Unnamed Item ⋮ A Note on the Differences of Computably Enumerable Reals ⋮ Information disclosure in the framework of Kolmogorov complexity ⋮ Supermartingales in Prediction with Expert Advice ⋮ Dynamically Delayed Postdictive Completeness and Consistency in Learning ⋮ Dynamic Modeling in Inductive Inference ⋮ Numberings Optimal for Learning ⋮ Universal Recursively Enumerable Sets of Strings ⋮ Effective packing dimension of $\Pi ^0_1$-classes ⋮ Evaluating the Impact of Information Distortion on Normalized Compression Distance ⋮ Multiplex signal transmission and the development of sampling techniques: the work of Herbert Raabe in contrast to that of Claude Shannon ⋮ Randomness, relativization and Turing degrees ⋮ Random reals and possibly infinite computations Part I: Randomness in ∅′ ⋮ Hilbert’s 6th Problem: exact and approximate hydrodynamic manifolds for kinetic equations ⋮ The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences ⋮ Schnorr Randomness ⋮ Trivial Reals ⋮ Kolmogorov Complexity Theory over the Reals ⋮ Refined Bounds on Kolmogorov Complexity for ω-Languages ⋮ On Oscillation-free ε-random Sequences ⋮ Connectivity Properties of Dimension Level Sets ⋮ Numberings and Randomness ⋮ Index Sets and Universal Numberings ⋮ A Divergence Formula for Randomness and Dimension ⋮ Representing graphs implicitly using almost optimal space ⋮ Construction of expanders and superconcentrators using Kolmogorov complexity ⋮ Induction: From Kolmogorov and Solomonoff to De Finetti and Back to Kolmogorov ⋮ Kolmogorov Complexity of Categories ⋮ RECOGNIZING STRONG RANDOM REALS ⋮ Π10 classes and strong degree spectra of relations ⋮ NL-printable sets and Nondeterministic Kolmogorov Complexity ⋮ Shannon entropy: a rigorous notion at the crossroads between probability, information theory, dynamical systems and statistical physics ⋮ Regular reals ⋮ Explanatory and creative alternatives to the MDL principle ⋮ Completeness, Compactness, Effective Dimensions ⋮ PAC Learning under Helpful Distributions ⋮ The Dynamics of Cellular Automata in Shift-Invariant Topologies ⋮ Kolmogorov complexity and cellular automata classification ⋮ Probability theory for the Brier game ⋮ Multistep Bayesian Strategy in Coin-Tossing Games and Its Application to Asset Trading Games in Continuous Time ⋮ New error bounds for Solomonoff prediction ⋮ Working with strong reducibilities above totally $\omega $-c.e. and array computable degrees ⋮ Predictability: a way to characterize complexity ⋮ 2000-2001 Winter Meeting of the Association for Symbolic Logic ⋮ Philosophical issues in Kolmogorov complexity ⋮ Finding paths through narrow and wide trees ⋮ Computability and information in models of randomness and chaos ⋮ Mass Problems and Randomness ⋮ Relative randomness and real closed fields ⋮ A minimal pair of 𝐾-degrees ⋮ Stack-like and queue-like dynamics in recurrent neural networks ⋮ Definability of Geometric Properties in Algebraically Closed Fields ⋮ One or Many Concepts of Information? ⋮ Shiner–Davison–Landsberg complexity revisited ⋮ Artificial sequences and complexity measures ⋮ On the Kolmogorov Complexity of Continuous Real Functions ⋮ Kolmogorov complexity and the Recursion Theorem ⋮ Increasing the gap between descriptional complexity and algorithmic probability ⋮ Effective Complexity as a Measure of Information Content ⋮ Kolmogorov Complexity and Model Selection ⋮ Kolmogorov complexity and characteristic constants of formal theories of arithmetic ⋮ Kolmogorov complexity and set theoretical representations of integers ⋮ Nonlinear phenomena in spaces of algorithms ⋮ Computable Bayesian Compression for Uniformly Discretizable Statistical Models ⋮ Good Randomized Sequential Probability Forecasting is Always Possible ⋮ Calibrating Randomness ⋮ Degrees of monotone complexity ⋮ A computable version of the random signs problem and Kolmogorov complexity ⋮ Kolmogorov Complexity in Perspective Part I: Information Theory and Randomness ⋮ Resource bounded symmetry of information revisited ⋮ Sequential predictions based on algorithmic complexity ⋮ 1999–2000 Winter Meeting of the Association for Symbolic Logic ⋮ COMPOSITIONALITY, COMPUTABILITY, AND COMPLEXITY ⋮ Closure of resource-bounded randomness notions under polynomial time permutations
This page was built for publication:
