Structural and functional properties are investigated for families of the in nite algorithmic processes
that represent abstract operations above con gurations of an abstract knowledge space which are
generated by recursively enumerable sets of transition and stop operators that realize transformations
of values of con gurations components and recognition of such values as nal.
