Calibrating Randomness

From MaRDI portal
Publication:3412463

DOI10.2178/bsl/1154698741zbMath1113.03037OpenAlexW4210959615MaRDI QIDQ3412463

Sebastiaan A. Terwijn, André Nies, Denis R. Hirschfeldt, Rodney G. Downey

Publication date: 6 December 2006

Published in: Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/d6fab3aaaadf3c7ae59c646591f84cfa44e5fdd4



Related Items

Bounded Randomness, Expected utility theory from the frequentist perspective, Randomness, Computation and Mathematics, Turing incomparability in Scott sets, Randomness and universal machines, Strong jump-traceability. II: \(K\)-triviality, Randomness? What randomness?, Undecidability of the structure of the Solovay degrees of c.e. reals, Optimal redundancy in computations from random oracles, Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension, Functions that preserve p-randomness, A Pseudo-Random Generator Whose Output is a Normal Sequence, Martin-Löf random generalized Poisson processes, Effectively approximating measurable sets by open sets, Extending and interpreting Post's programme, Some Questions in Computable Mathematics, Characterizing the strongly jump-traceable sets via randomness, Algorithmically Independent Sequences, Effective packing dimension of $\Pi ^0_1$-classes, Binary subtrees with few labeled paths, Schnorr trivial reals: a construction, A basis theorem for Π₁⁰ classes of positive measure and jump inversion for random reals, Does truth-table of linear norm reduce the one-query tautologies to a random oracle?, Strong jump-traceability. I: The computably enumerable case, Schnorr trivial sets and truth-table reducibility, The upward closure of a perfect thin class, Algorithmically independent sequences, Time-universal data compression, RECOGNIZING STRONG RANDOM REALS, Turing degrees of reals of positive effective packing dimension, Schnorr triviality and genericity, The importance of Π10 classes in effective randomness, Hyperimmune-free degrees and Schnorr triviality, A minimal pair of 𝐾-degrees, A universal pair of 1/2-betting strategies, Low upper bounds of ideals, Lowness for Kurtz randomness, Promptness does not imply superlow cuppability, The strength of the rainbow Ramsey Theorem, Inherent enumerability of strong jump-traceability, MARTIN-LÖF RANDOMNESS IN SPACES OF CLOSED SETS, Lowness properties and randomness, Kolmogorov-Loveland randomness and stochasticity, Unpredictability of complex (pure) strategies, Resource-bounded martingales and computable Dowd-type generic sets



Cites Work