Cited in
(only showing first 100 items - show all)- Not all (possibly) “random” sequences are created equal
- Universal computably enumerable sets and initial segment prefix-free complexity
- Program size complexity for possibly infinite computations
- Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension
- Expected utility theory from the frequentist perspective
- Some Aspects of the Relationship between Mathematical Logic and Physics. I
- An incomplete set of shortest descriptions
- Weakly useful sequences
- A universal statistical test for random bit generators
- Process and truth-table characterisations of randomness
- Randomness and initial segment complexity for measures
- Unpredictability and computational irreducibility
- Computing halting probabilities from other halting probabilities
- Unprincipled
- �ber die Definition von effektiven Zufallstests
- Schnorr randomness
- Pathwise-randomness and models of second-order arithmetic
- Mass problems associated with effectively closed sets
- Strict process machine complexity
- scientific article; zbMATH DE number 4011516 (Why is no real title available?)
- Lower bounds for Levin-Kolmogorov complexity
- Finite state incompressible infinite sequences
- On weakly correlated random numbers generator
- Oscillation in the initial segment complexity of random reals
- Universal recursively enumerable sets of strings
- Algorithmically independent sequences
- 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
- On the robustness of ALMOST-$\mathcal {R}$
- Randomness and universal machines
- Granularity of wagers in games and the possibility of saving
- Randomness: quantum versus classical
- On Martin-Löf (non-)convergence of Solomonoff's universal mixture
- Translating the Cantor set by a random real
- Recursively enumerable reals and Chaitin \(\Omega\) numbers
- On the hierarchy and extension of monotonically computable real numbers.
- A divergence formula for randomness and dimension
- Presentations of computably enumerable reals.
- Sub-computable bounded pseudorandomness
- Some theorems on the algorithmic approach to probability theory and information theory (1971 dissertation directed by A. N. Kolmogorov)
- Equivalences between learning of data and probability distributions, and their applications
- Martin-Löf random quantum states
- The generalized universal law of generalization.
- Do stronger definitions of randomness exist?
- Computational depth and reducibility
- Randomness for non-computable measures
- Undecidability of the structure of the Solovay degrees of c.e. reals
- Integer valued betting strategies and Turing degrees
- On empirical meaning of randomness with respect to parametric families of probability distributions
- Subcomputable Schnorr randomness
- The random members of a \({\Pi }_{1}^{0}\) class
- Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series
- On fairness and randomness
- Kolmogorov and mathematical logic
- Hintikka and the functions of logic
- Model discrimination using an algorithmic information criterion
- Randomness on full shift spaces
- Recognizing strong random reals
- Liouville, computable, Borel normal and Martin-Löf random numbers
- A NOTE ON THE LEARNING-THEORETIC CHARACTERIZATIONS OF RANDOMNESS AND CONVERGENCE
- On the Weihrauch degree of the additive Ramsey theorem
- On the first-order parts of problems in the Weihrauch degrees
- Complexity oscillations in infinite binary sequences
- A computational definition of financial randomness
- Kolmogorov-Complexity Based on Infinite Computations
- The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences
- An empirical study of the complexity and randomness of prediction error sequences
- A Church-Turing thesis for randomness?
- Imprecision in martingale- and test-theoretic prequential randomness
- Identifying randomness given by high descriptive complexity
- \(\Sigma^ 0_ n\)-complete properties of programs and Martin-Löf randomness
- Applying MDL to learn best model granularity
- Testing exchangeability in the batch mode with e-values and Markov alternatives
- A survey of Mučnik and Medvedev degrees
- Characterising the Martin-Löf random sequences using computably enumerable sets of measure one
- Measure and cupping in the Turing degrees
- Constructive equivalence relations on computable probability measures
- The sum \(2^{KM(x)-K(x)}\) over all prefixes \(x\) of some binary sequence can be infinite
- scientific article; zbMATH DE number 7204368 (Why is no real title available?)
- Amount of Nonconstructivity in Finite Automata
- Non-Algorithmic Theory of Randomness
- Compressibility, laws of nature, initial conditions and complexity
- Probabilities over rich languages, testing and randomness
- Solution of nonlinear equations with space filling curves
- Binary Pseudo-Random Sequences Theory
- Randomness deficiencies
- On a theorem of gács
- Every 2-random real is Kolmogorov random
- Schnorr randomness
- Resource-bounded martingales and computable Dowd-type generic sets
- Dimension and the structure of complexity classes
- Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs
- Mass problems and measure-theoretic regularity
- Quasi-Monte Carlo methods and pseudo-random numbers
- Towards a new theory of confirmation
- When does randomness come from randomness?
- Randomness on computable probability spaces -- a dynamical point of view
- On the non-randomness of maximum Lempel Ziv complexity sequences of finite size
- Kolmogorov complexity arguments in combinatorics
- The Perils of Balance Testing in Experimental Design: Messy Analyses of Clean Data
This page was built for publication: The definition of random sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5656214)
