Abstract
An earlier paper gives an account of a quest for a satisfactory
formalization of the classical informal notion of an algorithm.
In this paper, an attempt is made to generalize the results of that
quest to the informal notion of an interactive algorithm.
The notion of an interactive proto-algorithm is introduced.
Interactive algorithms are expected to be equivalence classes of
interactive proto-algorithms under an appropriate equivalence relation.
As in the non-interactive case, three equivalence relations are defined.
Two of them are deemed to be bounds for an appropriate equivalence
relation and the third is likely an appropriate one.