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)
- 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
- 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
- On the notion of infinite pseudorandom sequences
- Computability of probability measures and Martin-Löf randomness over metric spaces
- Title not available (Why is that?)
- Mathematical metaphysics of randomness
- Almost everywhere high nonuniform complexity
- Bernoulli randomness and Bernoulli normality
- Process complexity and effective random tests
- Circuit size relative to pseudorandom oracles
- The EM algorithm for graphical association models with missing data
- On the complexities of de-Bruijn sequences
- Pseudo-randomness and complexity of binary sequences generated by the chaotic system
- The descriptive complexity of Brownian motion
- Calibrating Randomness
- The Kolmogorov complexity of infinite words
- On collapsing the polynomial-time hierarchy
- Dynamics of a generic Brownian motion: Recursive aspects
- Endliche Automaten und Zufallsfolgen
- On partial randomness
- Mass Problems and Randomness
- RELATIVIZING CHAITIN'S HALTING PROBABILITY
- Chaitin's halting probability and the compression of strings using oracles
- On continued fraction randomness and normality
- Random reals and possibly infinite computations Part I: Randomness in ∅′
- Mass Problems and Measure-Theoretic Regularity
- Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers
- On the construction of effectively random sets
- Uniform test of algorithmic randomness over a general space
- Schnorr triviality and its equivalent notions
- Algorithmic tests and randomness with respect to a class of measures
- Lowness properties and randomness
- Kolmogorov-Loveland randomness and stochasticity
- Random reals, the rainbow Ramsey theorem, and arithmetic conservation
- How powerful are integer-valued martingales?
- Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega
- Lowness and nullsets
- Computational randomness and lowness
- Lowness for the class of random sets
- Generalized probabilities taking values in non-Archimedean fields and in topological groups
- HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMIT
- When van Lambalgen’s Theorem fails
- Difference randomness
- On initial segment complexity and degrees of randomness
- Schnorr trivial sets and truth-table reducibility
- Genericity and measure for exponential time
- Resource bounded randomness and weakly complete problems
- The importance of Π10 classes in effective randomness
- An Application of Martin-Löf Randomness to Effective Probability Theory
- On Oscillation-free ε-random Sequences
- 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.
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)
