The definition of random sequences
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Gales suffice for constructive dimension
- Dimension extractors and optimal decompression
- From exact sciences to life phenomena: Following Schrödinger and Turing on programs, life and causality
- A topological characterization of random sequences
- Constructive equivalence relations on computable probability measures
- Random sequences of binary digits in which missing values can almost certainly be restored
- On the relation between descriptional complexity and algorithmic probability
- Towards a new theory of confirmation
- On the notion of infinite pseudorandom sequences
- Incompleteness theorems for random reals
- Random problems
- An unpredictability approach to finite-state randomness
- An improved zero-one law for algorithmically random sequences
- Towards a theory of chance - Part II
- Complexity of algorithms and computations
- Theory construction in psychology: The interpretation and integration of psychological data
- The Arnol'd cat: Failure of the correspondence principle
- Random languages for nonuniform complexity classes
- On independent random oracles
- Groups and dynamical systems. Discrete time dynamics on the E(2) group
- Universal forecasting algorithms
- Almost everywhere high nonuniform complexity
- Inductive reasoning and Kolmogorov complexity
- A universal statistical test for random bit generators
- Circuit size relative to pseudorandom oracles
- Note on the topological structure of random strings
- \(\Sigma^ 0_ n\)-complete properties of programs and Martin-Löf randomness
- Randomness, independence, and hypotheses
- Objectively homogeneous reference classes
- Model discrimination using an algorithmic information criterion
- Mathematical metaphysics of randomness
- Ergodic theorems for individual random sequences
- Non-stochastic infinite and finite sequences
- Identifying randomness given by high descriptive complexity
- Kolmogorov complexity arguments in combinatorics
- Computational depth and reducibility
- On collapsing the polynomial-time hierarchy
- On the problem of stable image restoration
- Genericity and measure for exponential time
- The discovery of algorithmic probability
- Nonstandard (non-\(\sigma\)-additive) probabilities in algebraic quantum field theory
- Resource bounded randomness and weakly complete problems
- Do stronger definitions of randomness exist?
- Random elements in effective topological spaces with measure.
- The generalized universal law of generalization.
- On the hierarchy and extension of monotonically computable real numbers.
- Resource bounded randomness and computational complexity
- Applying MDL to learn best model granularity
- The descriptive complexity of Brownian motion
- Presentations of computably enumerable reals.
- An approach of randomness of a sample based on its weak ergodic limit
- Open problems in universal induction \& intelligence
- Optimal redundancy in computations from random oracles
- Dimension 1 sequences are close to randoms
- Universal probability-free prediction
- The principles of informational genomics
- Schnorr randomness for noncomputable measures
- Layerwise computability and image randomness
- Equidistribution, uniform distribution: a probabilist's perspective
- Compressibility, laws of nature, initial conditions and complexity
- A Chaitin number based on compressible strings
- Weakly useful sequences
- Randomness relative to Cantor expansions
- Prediction and dimension
- Equivalences between learning of data and probability distributions, and their applications
- Liouville, computable, Borel normal and Martin-Löf random numbers
- The random members of a \({\Pi }_{1}^{0}\) class
- Algorithmically random series and Brownian motion
- On the complexities of de-Bruijn sequences
- Symbolic dynamics of one-dimensional maps: Entropies, finite precision, and noise
- Recursive computational depth.
- Randomness on full shift spaces
- Randomness and reducibility
- On Kurtz randomness
- The dimensions of individual strings and sequences
- The Kolmogorov complexity of random reals
- Competition and the canonical ensemble
- Weakly complete problems are not rare
- Effective randomness of unions and intersections
- Amount of nonconstructivity in deterministic finite automata
- Feasible reductions to Kolmogorov-Loveland stochastic sequences
- Revisiting Chaitin's incompleteness theorem
- Randomness deficiencies
- Randomness and initial segment complexity for measures
- Learning (to disagree?) in large worlds
- Randomness is inherently imprecise
- Testing randomness online
- Modeling parallel transport
- 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
- Randomness below complete theories of arithmetic
- A Church-Turing thesis for randomness?
- Simple betting and stochasticity
- A brief and understandable guide to pseudo-random number generators and specific models for security
- Randomness? What randomness?
- Granularity of wagers in games and the possibility of saving
- Bi-immunity over different size alphabets
- Things that can be made into themselves
- Process complexity and effective random tests
- Microscopic reversibility and macroscopic irreversibility: from the viewpoint of algorithmic randomness
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)
