A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Information, Randomness & Incompleteness
Solovay and Strassen, and Miller and Rabin have discovered fast algorithms for testing primality which use coin-flipping and whose con- G. J. Chaitin clusions are only probably correct. On the other hand, algorithmic information theory provides a precise mathematical definition of the notion of random or patternless sequence. In this paper we shall describe conditions under which if the sequence of coin tosses in the Solovay-Strassen and Miller-Rabin algorithms is replaced by a sequence ofdoi:10.1142/9789814434058_0016 fatcat:apf7bbkpcbbsngzm4dytoskfla