The definition of random sequences

Cited In (only showing first 100 items - show all)

Program size complexity for possibly infinite computations
Schnorr randomness
Process and truth-table characterisations of randomness
Computing halting probabilities from other halting probabilities
Recursively enumerable reals and Chaitin $\Omega$ numbers
Universal recursively enumerable sets of strings
Randomness and universal machines
Computational depth and reducibility
Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series
Kolmogorov and mathematical logic
On empirical meaning of randomness with respect to parametric families of probability distributions
Liouville, computable, Borel normal and Martin-Löf random numbers
An empirical study of the complexity and randomness of prediction error sequences
$\Sigma^ 0_ n$-complete properties of programs and Martin-Löf randomness
Constructive equivalence relations on computable probability measures
On Kurtz randomness
Trivial measures are not so trivial
Recursive computational depth.
Algorithmically Random Functions and Effective Capacities
Significance testing with no alternative hypothesis: A measure of surprise
Demuth's path to randomness
On the problem of stable image restoration
A characterization of constructive dimension
Algorithmic complexity of points in dynamical systems
Dimension extractors and optimal decompression
Experimental investigation of forecasting methods based on data compression algorithms
Randomness and the ergodic decomposition
Simple betting and stochasticity
A divergence formula for randomness and dimension
Arithmetical representations of Brownian motion I
The discovery of algorithmic probability
Universality probability of a prefix-free machine
Computable Measure Theory and Algorithmic Randomness
Symbolic dynamics of one-dimensional maps: Entropies, finite precision, and noise
Algorithmic information theory and its statistical mechanical interpretation
Weakly useful sequences
Kolmogorov complexity in perspective. I: Information theory and randomness
The descriptive complexity of stochastic integration
Kolmogorov-Loveland stochasticity for finite strings
Prequential randomness and probability
Weakly complete problems are not rare
Probabilistic issues in statistical mechanics
Revisiting Chaitin's incompleteness theorem
On relative randomness
Universal Recursively Enumerable Sets of Strings
Inductive reasoning and Kolmogorov complexity
Two-Way Non-Uniform Finite Automata
Random sequences with respect to a measure defined by two linear fractional transformations
Partial Randomness and Dimension of Recursively Enumerable Reals
On a conjecture of Dobrinen and Simpson concerning almost everywhere domination
The Arnol'd cat: Failure of the correspondence principle
Measures and their random reals
Algorithmic randomness of continuous functions
Gales suffice for constructive dimension
Randomness? What randomness?
Effective randomness for computable probability measures
An unpredictability approach to finite-state randomness
Fractals generated by algorithmically random Brownian motion
Multiple usage of random bits in finite automata
Chaos out of order: quantum mechanics, the correspondence principle and chaos
Identification of probabilities
Amount of nonconstructivity in deterministic finite automata
An improved zero-one law for algorithmically random sequences
On analogues of the Church-Turing thesis in algorithmic randomness
Probabilistic Algorithmic Randomness
Algorithmic randomness and monotone complexity on product space
An observation on probability versus randomness with applications to complexity classes
Relativized Schnorr tests with universal behavior
Not all (possibly) “random” sequences are created equal
Unreasonable effectiveness of symmetry in physics
Pure quantum states are fundamental, mixtures (composite states) are mathematical constructions: An argument using algorithmic information theory
Random numbers as probabilities of machine behavior
Kobayashi compressibility
Randomness and initial segment complexity for measures
On the robustness of ALMOST-$\mathcal {R}$
Algorithmically independent sequences
On the hierarchy and extension of monotonically computable real numbers.
Randomness for non-computable measures
Equivalences between learning of data and probability distributions, and their applications
The generalized universal law of generalization.
The random members of a ${\Pi }_{1}^{0}$ class
On fairness and randomness
Identifying randomness given by high descriptive complexity
Measure and cupping in the Turing degrees
Characterising the Martin-Löf random sequences using computably enumerable sets of measure one
On a theorem of gács
Binary Pseudo-Random Sequences Theory
Solution of nonlinear equations with space filling curves
WORD COMPLEXITY AND REPETITIONS IN WORDS
Eine Bemerkung zum Begriff der zuf�lligen Folge
Well-calibrated predictions from on-line compression models
Computing a Glimpse of Randomness
From exact sciences to life phenomena: Following Schrödinger and Turing on programs, life and causality
SYSTEM IDENTIFICATION, APPROXIMATION AND COMPLEXITY
Randomness relative to Cantor expansions
Towards a theory of chance - Part II
Complexity of algorithms and computations
On complexity classes and algorithmically random languages (extended abstract)
Title not available (Why is that?)
On semimeasures predicting Martin-Löf random sequences

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)