scientific article; zbMATH DE number 3942590

MaRDI QIDQ3713236zbMATH OpenFDO

Authors Branislav D. Vidaković

Publication date 1985

zbMATH Keywords

Martin Löf tests of randomness of infinite binary wordsmeasures of complexity

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Axioms; other general questions in probability (60A05) Foundations of probability theory (60A99)

Recommendations

• scientific article; zbMATH DE number 4045148
• Characterising the Martin-Löf random sequences using computably enumerable sets of measure one
• On new measures of pseudorandomness of binary lattices
• On semimeasures predicting Martin-Löf random sequences
• scientific article; zbMATH DE number 4103057
• On the l.c.m. of random terms of binary recurrence sequences
• Measures of pseudorandomness for binary sequences constructed using finite fields
• Algorithmic Complexity and Stochastic Properties of Finite Binary Sequences
• Relative randomness for Martin-Löf random sets
• Finite and infinite pseudorandom binary words

Cited in

(2)

• On semimeasures predicting Martin-Löf random sequences
• scientific article; zbMATH DE number 4045148 (Why is no real title available?)

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 Q3713236)