Abstract
Chaitin and Schwartz [4] have proved that Solovay and Strassen [12], Miller [9], and Rabin [10] probabilistic algorithms for testing primality are error‐free in case the input sequence of coin tosses has maximal information content. In this paper we shall describe conditions under which a probabilistic algorithm gives the correct output. We shall work with algorithms having the ability to make “random” decisions not necessarily binary (Zimand [13]). We shall prove that if a probabilistic algorithm is sufficiently “correct”, then it is error‐free on all sufficiently long inputs which are random in Kolmogorov and Martin-Lofs sense. Our result, as well as Chaitin and Schwartz's one, is only of theoretical interest, since the set of all random strings is immune (Calude and Chitescu [2]).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
