A combinatorial characterization of sequential p. martin-löf tests

DOI10.1080/00207168508803450zbMath0562.03020OpenAlexW2051745505WikidataQ57001808 ScholiaQ57001808MaRDI QIDQ5187267

Ion Chiţescu, Cristian S. Calude

Publication date: 1985

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168508803450

zbMATH Keywords

recursively enumerable setfree monoidprefix-free set

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Complexity of computation (including implicit computational complexity) (03D15)

Related Items (1)

Randomness as an invariant for number representations

Cites Work

• Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
• The definition of random sequences

This page was built for publication: A combinatorial characterization of sequential p. martin-löf tests