In this paper Conway’s algorithm for computing prime numbers is refined. The algorithm analysis shows that some numbers obtained using it are incorrect. Further investigations lead to the definition of certain computable functions and the establishment of the equivalence of this class of functions and the class of recursive functions.
L. N. Chernetskaja (Kyïv)