The definition of random sequences

DOI10.1016/S0019-9958(66)80018-9zbMath0244.62008WikidataQ29395007 ScholiaQ29395007MaRDI QIDQ5656214

Per Martin-Löf

Publication date: 1966

Published in: Information and Control (Search for Journal in Brave)

Mathematics Subject Classification ID

Foundations and philosophical topics in statistics (62A01) Axioms; other general questions in probability (60A05)

Related Items (only showing first 100 items - show all)

A Quest for Algorithmically Random Infinite Structures, II ⋮ [https://portal.mardi4nfdi.de/wiki/Publication:5581622 Eine Bemerkung zum Begriff der zuf�lligen Folge] ⋮ Probabilistic Algorithmic Randomness ⋮ European Summer Meeting of the Association for Symbolic Logic ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Some Aspects of the Relationship between Mathematical Logic and Physics. I ⋮ Schnorr randomness ⋮ On the construction of effectively random sets ⋮ Every 2-random real is Kolmogorov random ⋮ Complexity oscillations in infinite binary sequences ⋮ [https://portal.mardi4nfdi.de/wiki/Publication:5617399 �ber die Definition von effektiven Zufallstests] ⋮ A unified approach to the definition of random sequences ⋮ Bayesian definition of random sequences with respect to conditional probabilities ⋮ Bernoulli randomness and Bernoulli normality ⋮ On local times of Martin-Löf random Brownian motion ⋮ Did Jean Ville Invent Martingales? ⋮ Martingales in the Study of Randomness ⋮ Dimension and the structure of complexity classes ⋮ Projection theorems using effective dimension ⋮ Randomness as an invariant for number representations ⋮ Two-Way Non-Uniform Finite Automata ⋮ Turing degrees and randomness for continuous measures ⋮ A LEARNING-THEORETIC CHARACTERISATION OF MARTIN-LÖF RANDOMNESS AND SCHNORR RANDOMNESS ⋮ Growth and irreducibility in path-incompressible trees ⋮ Statistical Study of Digits of Some Square Roots of Integers in Various Bases ⋮ Unnamed Item ⋮ A basis theorem for Π₁⁰ classes of positive measure and jump inversion for random reals ⋮ An incomplete set of shortest descriptions ⋮ WORD COMPLEXITY AND REPETITIONS IN WORDS ⋮ Unnamed Item ⋮ Randomness, relativization and Turing degrees ⋮ Random reals and possibly infinite computations Part I: Randomness in ∅′ ⋮ On the computability of a construction of Brownian motion ⋮ Algorithmic randomness over general spaces ⋮ Translating the Cantor set by a random real ⋮ ON ANALOGUES OF THE CHURCH–TURING THESIS IN ALGORITHMIC RANDOMNESS ⋮ Shannon entropy: a rigorous notion at the crossroads between probability, information theory, dynamical systems and statistical physics ⋮ Kolmogorov complexity and the geometry of Brownian motion ⋮ Recursively enumerable reals and Chaitin \(\Omega\) numbers ⋮ Kolmogorov complexity and cellular automata classification ⋮ Predictability: a way to characterize complexity ⋮ A characterization of c. e. random reals ⋮ Unprincipled ⋮ Pathwise-randomness and models of second-order arithmetic ⋮ Imprecision in martingale- and test-theoretic prequential randomness ⋮ Computability and information in models of randomness and chaos ⋮ Theoretical computer science: computability, decidability and logic ⋮ Retracing some paths in categorical semantics: from process-propositions-as-types to categorified reals and computers ⋮ Randomness quality and trade-offs for CA random string generators ⋮ Transparallel processing by hyperstrings ⋮ Testing randomness by Matching Pennies ⋮ Computing a Glimpse of Randomness ⋮ On a conjecture of Dobrinen and Simpson concerning almost everywhere domination ⋮ Martin-Löf random quantum states ⋮ A computational definition of financial randomness ⋮ Measures and their random reals ⋮ Kolmogorov Complexity in Perspective Part I: Information Theory and Randomness ⋮ The Perils of Balance Testing in Experimental Design: Messy Analyses of Clean Data ⋮ Continuous higher randomness ⋮ Randomness and reducibility ⋮ Higher randomness and forcing with closed sets ⋮ Demuth’s Path to Randomness ⋮ A Survey of Mučnik and Medvedev Degrees ⋮ On Kurtz randomness ⋮ The dimensions of individual strings and sequences ⋮ Multiple Usage of Random Bits in Finite Automata ⋮ The Kolmogorov complexity of random reals ⋮ A brief and understandable guide to pseudo-random number generators and specific models for security ⋮ Expected utility theory from the frequentist perspective ⋮ Randomness, Computation and Mathematics ⋮ Mutual dimension and random sequences ⋮ On semimeasures predicting Martin-Löf random sequences ⋮ Initial segment complexities of randomness notions ⋮ The Kolmogorov complexity of infinite words ⋮ Pseudorandom sources for BPP ⋮ Computability of probability measures and Martin-Löf randomness over metric spaces ⋮ Kolmogorov-Loveland stochasticity for finite strings ⋮ An approach of randomness of a sample based on its weak ergodic limit ⋮ Open problems in universal induction \& intelligence ⋮ Competition and the canonical ensemble ⋮ Differences of halting probabilities ⋮ Weakly complete problems are not rare ⋮ Randomness? What randomness? ⋮ Optimal redundancy in computations from random oracles ⋮ Dimension 1 sequences are close to randoms ⋮ Universal probability-free prediction ⋮ Randomness and uniform distribution modulo one ⋮ On continued fraction randomness and normality ⋮ The principles of informational genomics ⋮ Schnorr randomness for noncomputable measures ⋮ The Kučera-Gács theorem revisited by Levin ⋮ Layerwise computability and image randomness ⋮ Effective randomness of unions and intersections ⋮ Amount of nonconstructivity in deterministic finite automata ⋮ Feasible reductions to Kolmogorov-Loveland stochastic sequences ⋮ Granularity of wagers in games and the possibility of saving ⋮ The sure thing principle, dilations, and objective probabilities ⋮ On the hierarchy and extension of monotonically computable real numbers. ⋮ Revisiting Chaitin's incompleteness theorem

This page was built for publication: The definition of random sequences