A relation between correctness and randomness in the computation of probabilistic algorithms

DOI10.1080/00207168408803423zbMath0552.68051OpenAlexW2084686533WikidataQ57001812 ScholiaQ57001812MaRDI QIDQ3345786

Marius Zimand, Cristian S. Calude

Publication date: 1984

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

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

zbMATH Keywords

probabilistic algorithmrandom stringsprobabilistic primality testsKolmogorov's complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cites Work

• Unnamed Item
• Unnamed Item
• Riemann's hypothesis and tests for primality
• Strong noncomputability of random strings
• A Fast Monte-Carlo Test for Primality
• Computational Complexity of Probabilistic Turing Machines
• A note on monte carlo primality tests and algorithmic information theory
• The definition of random sequences