The definition of random sequences
From MaRDI portal
Publication:5656214
DOI10.1016/S0019-9958(66)80018-9zbMATH Open0244.62008WikidataQ29395007 ScholiaQ29395007MaRDI QIDQ5656214FDOQ5656214
Publication date: 1966
Published in: Information and Control (Search for Journal in Brave)
Foundations and philosophical topics in statistics (62A01) Axioms; other general questions in probability (60A05)
Cited In (only showing first 100 items - show all)
- Randomness and initial segment complexity for measures
- On the robustness of ALMOST-$\mathcal {R}$
- On complexity classes and algorithmically random languages
- 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.
- Kolmogorov and mathematical logic
- 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
- 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
- Significance testing with no alternative hypothesis: A measure of surprise
- SYSTEM IDENTIFICATION, APPROXIMATION AND COMPLEXITY
- Randomness relative to Cantor expansions
- Towards a theory of chance - Part II
- Complexity of algorithms and computations
- Title not available (Why is that?)
- On semimeasures predicting Martin-Löf random sequences
- A topological characterization of random sequences
- Theory construction in psychology: The interpretation and integration of psychological data
- Randomness, independence, and hypotheses
- Objectively homogeneous reference classes
- On independent random oracles
- A relation between correctness and randomness in the computation of probabilistic algorithms
- Random languages for nonuniform complexity classes
- Computability versus exact computability of martingales
- Defining a randomness notion via another
- Groups and dynamical systems. Discrete time dynamics on the E(2) group
- Universal forecasting algorithms
- Non-stochastic infinite and finite sequences
- Random problems
- Computation of recursive functionals using minimal initial segments
- Algorithmically Independent Sequences
- Prequential Randomness
- Random sequences of binary digits in which missing values can almost certainly be restored
- Random elements in effective topological spaces with measure.
- Schnorr trivial reals: a construction
- Note on the topological structure of random strings
- Statistical Study of Digits of Some Square Roots of Integers in Various Bases
- Equidistribution, uniform distribution: a probabilist's perspective
- Leading strategies in competitive on-line prediction
- A characterization of c. e. random reals
- Lowness for genericity
- Pseudorandom sources for BPP
- Prediction and dimension
- Universal computably enumerable sets and initial segment prefix-free complexity
- Functions that preserve p-randomness
- Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension
- A universal statistical test for random bit generators
- Mass problems associated with effectively closed sets
- Strict process machine complexity
- Translating the Cantor set by a random real
- Finite state incompressible infinite sequences
- Oscillation in the initial segment complexity of random reals
- A divergence formula for randomness and dimension
- Some theorems on the algorithmic approach to probability theory and information theory (1971 dissertation directed by A. N. Kolmogorov)
- Integer valued betting strategies and Turing degrees
- Undecidability of the structure of the Solovay degrees of c.e. reals
- Complexity oscillations in infinite binary sequences
- The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences
- A survey of Mučnik and Medvedev degrees
- The sum \(2^{KM(x)-K(x)}\) over all prefixes \(x\) of some binary sequence can be infinite
- Probabilities over rich languages, testing and randomness
- Dimension and the structure of complexity classes
- Every 2-random real is Kolmogorov random
- Schnorr randomness
- Mass problems and measure-theoretic regularity
- Quasi-Monte Carlo methods and pseudo-random numbers
- Kolmogorov complexity and cellular automata classification
- Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs
- Towards a new theory of confirmation
- Asymptotic behavior and ratios of complexity in cellular automata
- Randomness on computable probability spaces -- a dynamical point of view
- When does randomness come from randomness?
- A unified approach to the definition of random sequences
- Randomness, relativization and Turing degrees
- Open problems in universal induction \& intelligence
- Randomness and reducibility
- The Kolmogorov complexity of random reals
- Kolmogorov complexity and symmetric relational structures
- Modeling parallel transport
- Perfect necklaces
- Predictability: a way to characterize complexity
- Incompleteness theorems for random reals
- Shannon entropy: a rigorous notion at the crossroads between probability, information theory, dynamical systems and statistical physics
- Resource bounded randomness and computational complexity
- The dimensions of individual strings and sequences
- Ergodic theorems for individual random sequences
- On a definition of random sequences with respect to conditional probability
- On the relation between descriptional complexity and algorithmic probability
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)
