Calibrating Randomness
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1687020 (Why is no real title available?)
- scientific article; zbMATH DE number 2186306 (Why is no real title available?)
- scientific article; zbMATH DE number 44693 (Why is no real title available?)
- scientific article; zbMATH DE number 736618 (Why is no real title available?)
- scientific article; zbMATH DE number 1010621 (Why is no real title available?)
- scientific article; zbMATH DE number 3034028 (Why is no real title available?)
- A Kolmogorov complexity characterization of constructive Hausdorff dimension.
- A Theory of Program Size Formally Identical to Information Theory
- A basis theorem for Π₁⁰ classes of positive measure and jump inversion for random reals
- A generalization of Chaitin's halting probability \(\Omega\) and halting self-similar sets
- A mathematical proof of S. Shelah's theorem on the measure problem and related results
- A model of set-theory in which every set of reals is Lebesgue measurable
- A separation of two randomness concepts
- A tight upper bound on Kolmogorov complexity and uniformly optimal prediction
- A unified approach to the definition of random sequences
- A variant of the Kolmogorov concept of complexity
- Algorithmic randomness and complexity.
- Almost everywhere high nonuniform complexity
- Automata, languages and programming. 30th international colloquium, ICALP 2003, Eindhoven, The Netherland, June 30 -- July 4, 2003. Proceedings
- Automorphisms of the lattice of _1⁰ classes; perfect thin classes and anc degrees
- Category and Measure in Complexity Classes
- Characterising the Martin-Löf random sequences using computably enumerable sets of measure one
- Class groups of integral group rings
- Classical recursion theory. Vol. II
- Complexity dips in random infinite binary sequences
- Computational randomness and lowness
- Constructive dimension equals Kolmogorov complexity
- Counting the number of equivalence classes of Borel and coanalytic equivalence relations
- Degrees of Unsolvability. (AM-55)
- Dimension in Complexity Classes
- Effective fractal dimensions
- Effectively dense Boolean algebras and their applications
- Every 2-random real is Kolmogorov random
- Every sequence is reducible to a random one
- Incompleteness theorems for random reals
- Kolmogorov Complexity and Instance Complexity of Recursively Enumerable Sets
- Kolmogorov complexity and Hausdorff dimension
- Kolmogorov-Loveland randomness and stochasticity
- Lowness for the class of random sets
- Lowness properties and randomness
- Mathematical metaphysics of randomness
- On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line
- On Kurtz randomness
- On Schnorr and computable randomness, martingales, and machines
- On partial randomness
- On relative randomness
- On the construction of effectively random sets
- On the notion of infinite pseudorandom sequences
- Probabilities over rich languages, testing and randomness
- Process complexity and effective random tests
- RELATIVIZING CHAITIN'S HALTING PROBABILITY
- Random reals and possibly infinite computations Part I: Randomness in ∅′
- Randomness and recursive enumerability
- Randomness and reducibility
- Randomness, computability, and density
- Randomness, relativization and Turing degrees
- Recursively enumerable reals and Chaitin \(\Omega\) numbers
- Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion
- Schnorr randomness
- Subsequences of normal sequences
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- The Degrees of Hyperimmune Sets
- The Kolmogorov complexity of random reals
- The axiomatization of randomness
- The definition of random sequences
- The degrees of bi‐immune sets
- The dimensions of individual strings and sequences
- The fractal nature of Riem/Diff. I.
- There are 2^{ℵ₀} many 𝐻-degrees in the random reals
- There is no SW-complete c.e. real
- Upper semi-lattice of binary strings with the relation ``\(x\) is simple conditional to \(y\)
Cited in
(53)- Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension
- The upward closure of a perfect thin class
- Expected utility theory from the frequentist perspective
- A Pseudo-Random Generator Whose Output is a Normal Sequence
- Algorithmically independent sequences
- Randomness and universal machines
- Undecidability of the structure of the Solovay degrees of c.e. reals
- Some Questions in Computable Mathematics
- Recognizing strong random reals
- On the Weihrauch degree of the additive Ramsey theorem
- On the first-order parts of problems in the Weihrauch degrees
- Effectively approximating measurable sets by open sets
- Time-universal data compression
- Resource-bounded martingales and computable Dowd-type generic sets
- Schnorr triviality and genericity
- Bounded randomness
- The importance of \(\Pi^0_1\) classes in effective randomness
- Low upper bounds of ideals
- A glimpse into algorithmic information theory
- Hilbert's tenth problem for term algebras with a substitution operator
- Defining long words succinctly in FO and MSO
- Complemented subsets and Boolean-valued, partial functions
- Algorithmically random series
- Randomness, computation and mathematics
- Strong jump-traceability. I: The computably enumerable case
- Inherent enumerability of strong jump-traceability
- Hyperimmune-free degrees and Schnorr triviality
- Randomness and Computability: Open Questions
- Effective packing dimension of $\Pi ^0_1$-classes
- Turing degrees of reals of positive effective packing dimension
- Lowness for Kurtz randomness
- Turing incomparability in Scott sets
- Optimal redundancy in computations from random oracles
- A universal pair of 1/2-betting strategies
- A minimal pair of 𝐾-degrees
- The strength of the rainbow Ramsey Theorem
- Extending and interpreting Post's programme
- Lowness properties and randomness
- Kolmogorov-Loveland randomness and stochasticity
- A basis theorem for Π₁⁰ classes of positive measure and jump inversion for random reals
- Martin-Löf random generalized Poisson processes
- Algorithmically Independent Sequences
- Binary subtrees with few labeled paths
- Schnorr trivial reals: a construction
- Randomness? What randomness?
- Martin-Löf randomness in spaces of closed sets
- Strong jump-traceability. II: K-triviality
- An introduction to Kolmogorov complexity and its applications
- Characterizing the strongly jump-traceable sets via randomness
- Unpredictability of complex (pure) strategies
- Promptness does not imply superlow cuppability
- Schnorr trivial sets and truth-table reducibility
- Does truth-table of linear norm reduce the one-query tautologies to a random oracle?
This page was built for publication: Calibrating Randomness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3412463)
