On the average delay of the detection of cyclic loops

Abstract

In a previous paper the author of the present paper has proposed a method for the detection of some kinds of cyclic loops in computational processes. A particular case of the method has been indicated, which is optimal in a certain sens and makes use of Fibonacci numbers. In the present paper a comparison is made between the effectiveness of that particular case and the effectiveness of another particular case proposed earlier by R.P.Brent. A further optimal property of the particular case using Fibonacci numbers is established.