scientific article; zbMATH DE number 3920462

MaRDI QIDQ3695277zbMATH OpenFDO

Authors Ludwig Staiger

Publication date 1985

Full work available at URL https://eudml.org/doc/28687

zbMATH Keywords

representable M-L test

Mathematics Subject Classification ID

Applications of computability and recursion theory (03D80)

Cites work

• scientific article; zbMATH DE number 3839937 (Why is no real title available?)
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
• The definition of random sequences
• Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)

Cited in

(3)

• scientific article; zbMATH DE number 718639 (Why is no real title available?)
• scientific article; zbMATH DE number 908056 (Why is no real title available?)
• A combinatorial characterization of sequential p. martin-löf tests

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3695277)