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
- Program size complexity for possibly infinite computations
- 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
- On empirical meaning of randomness with respect to parametric families of probability distributions
- A Divergence Formula for Randomness and Dimension
- Liouville, computable, Borel normal and Martin-Löf random numbers
- Multiple Usage of Random Bits in Finite Automata
- 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
- Kolmogorov Complexity in Perspective Part I: Information Theory and Randomness
- Fractals Generated by Algorithmically Random Brownian Motion
- On Kurtz randomness
- Trivial measures are not so trivial
- Recursive computational depth.
- Algorithmically Random Functions and Effective Capacities
- Demuth's path to randomness
- On the problem of stable image restoration
- A characterization of constructive dimension
- Algorithmic complexity of points in dynamical systems
- Constraints placed on random sequences by their compressibility
- Measure, randomness and sublocales
- Dimension extractors and optimal decompression
- Experimental investigation of forecasting methods based on data compression algorithms
- Effective Randomness for Computable Probability Measures
- Simple betting and stochasticity
- 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
- The descriptive complexity of stochastic integration
- Kolmogorov-Loveland stochasticity for finite strings
- Prequential randomness and probability
- Weakly complete problems are not rare
- ON ANALOGUES OF THE CHURCH–TURING THESIS IN ALGORITHMIC RANDOMNESS
- Probabilistic issues in statistical mechanics
- Revisiting Chaitin's incompleteness theorem
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)
