A topological characterization of random sequences

DOI10.1016/j.ipl.2003.07.002zbMath1178.68255OpenAlexW1998902940WikidataQ57001694 ScholiaQ57001694MaRDI QIDQ1029024

Ludwig Staiger, Cristian S. Calude, Solomon Marcus

Publication date: 9 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2003.07.002

zbMATH Keywords

theory of computationrandom sequenceMartin-Löf test

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (6)

Subword Metrics for Infinite Words ⋮ Improvements on contours based segmentation for DNA microarray image processing ⋮ Set theory and the analyst ⋮ Liouville, computable, Borel normal and Martin-Löf random numbers ⋮ Topology on words ⋮ Shift-invariant topologies for the Cantor space \(X^{\omega}\)

Cites Work

• Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
• Measure-preserving homeomorphisms and metrical transitivity
• Every sequence is reducible to a random one
• Sequential mappings of $\omega $-languages
• On a theorem of gács
• Killing Residual Measures
• TOPOLOGIES FOR THE SET OF DISJUNCTIVE ω-WORDS
• The definition of random sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A topological characterization of random sequences