scientific article
From MaRDI portal
zbMath0312.94006MaRDI QIDQ4070738
Publication date: 1973
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Information theory (general) (94A15) Computability and recursion theory (03D99)
Related Items
Kolmogorov complexities \(K_{\max}\), \(K_{\min}\) on computable partially ordered sets, Randomness and reducibility, Random sequence generation by cellular automata, Computational depth and reducibility, The sum \(2^{KM(x)-K(x)}\) over all prefixes \(x\) of some binary sequence can be infinite, Computational depth and reducibility, Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations, On collapsing the polynomial-time hierarchy, On Kurtz randomness, The dimensions of individual strings and sequences, Multiple Usage of Random Bits in Finite Automata, The Kolmogorov complexity of random reals, On the notion of infinite pseudorandom sequences, Sub-computable Bounded Pseudorandomness, On semimeasures predicting Martin-Löf random sequences, An almost machine-independent theory of program-length complexity, sophistication, and induction, On generalized computable universal priors and their convergence, Dimension spectra of lines1, The discovery of algorithmic probability, A natural encoding scheme proved probabilistic polynomial complete, Unnamed Item, An improved zero-one law for algorithmically random sequences, Dimension 1 sequences are close to randoms, Extending the reach of the point-to-set principle, A circuit complexity formulation of algorithmic information theory, Martingales in the Study of Randomness, Andrei Kolmogorov and Leonid Levin on Randomness, The Kučera-Gács theorem revisited by Levin, A generalized characterization of algorithmic probability, Algorithmic randomness and monotone complexity on product space, A LEARNING-THEORETIC CHARACTERISATION OF MARTIN-LÖF RANDOMNESS AND SCHNORR RANDOMNESS, An algorithmic look at financial volatility, Prequential Randomness, Relations between varieties of kolmogorov complexities, Feasible reductions to Kolmogorov-Loveland stochastic sequences, Algorithmic randomness of continuous functions, On effectively closed sets of effective strong measure zero, Algorithmic complexity of recursive and inductive algorithms, Random reals à la Chaitin with or without prefix-freeness, Epistemic horizons and the foundations of quantum mechanics, On independent random oracles, Random sequences with respect to a measure defined by two linear fractional transformations, Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs, Inductive reasoning and Kolmogorov complexity, Equidistribution, uniform distribution: a probabilist's perspective, Leading strategies in competitive on-line prediction, On Oscillation-free ε-random Sequences, On empirical meaning of randomness with respect to parametric families of probability distributions, Algorithmic randomness over general spaces, Random Continuous Functions, Randomness deficiencies, Recursively enumerable reals and Chaitin \(\Omega\) numbers, Program size complexity for possibly infinite computations, On the computational power of random strings, Prequential randomness and probability, Process and truth-table characterisations of randomness, Unnamed Item, On the inference of optimal descriptions, On a definition of random sequences with respect to conditional probability, Scaled dimension and the Kolmogorov complexity of Turing-hard sets, Randomness and the Ergodic Decomposition, Mathematical metaphysics of randomness, Ergodic theorems for individual random sequences, Mutual Dimension, Randomness is inherently imprecise, Uniform test of algorithmic randomness over a general space, Kolmogorov Complexity in Perspective Part I: Information Theory and Randomness, On the relation between descriptional complexity and algorithmic probability, Recursive computational depth., Sequential predictions based on algorithmic complexity, Thinking with notations: epistemic actions and epistemic activities in mathematical practice, On the (dis)similarities between stationary imprecise and non-stationary precise uncertainty models in algorithmic randomness, Algorithmic Fractal Dimensions in Geometric Measure Theory
