scientific article; zbMATH DE number 3532844
From MaRDI portal
Publication:4109577
zbMath0341.94013MaRDI QIDQ4109577
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (27)
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 ⋮ Non-Algorithmic Theory of Randomness ⋮ Schnorr randomness for noncomputable measures ⋮ Bayesian definition of random sequences with respect to conditional probabilities ⋮ The Kučera-Gács theorem revisited by Levin ⋮ Randomness as an invariant for number representations ⋮ Confidence and discoveries with \(e\)-values ⋮ Turing degrees and randomness for continuous measures ⋮ A LEARNING-THEORETIC CHARACTERISATION OF MARTIN-LÖF RANDOMNESS AND SCHNORR RANDOMNESS ⋮ Prequential Randomness ⋮ Supermartingales in Prediction with Expert Advice ⋮ Independence, relative randomness, and PA degrees ⋮ Non-asymptotic calibration and resolution ⋮ Leading strategies in competitive on-line prediction ⋮ Effectively closed sets of measures and randomness ⋮ Prequential randomness and probability ⋮ Supermartingales in prediction with expert advice ⋮ Kolmogorov complexity and non-determinism ⋮ Algorithmic tests and randomness with respect to a class of measures ⋮ Computable randomness and betting for computable probability spaces ⋮ Prediction with Expert Evaluators’ Advice ⋮ Uniform test of algorithmic randomness over a general space ⋮ Effective randomness for continuous measures ⋮ On the (dis)similarities between stationary imprecise and non-stationary precise uncertainty models in algorithmic randomness ⋮ Computable Measure Theory and Algorithmic Randomness
This page was built for publication:
