The number of nonequivalent computable indexations for a fixed family of sets
The notion of reducibility for computable indexations, which is analogous to the ordinary reducibility of computable enumerations, is introduced. The question on the number of nonequivalent computable indexations is studied for the case of a fixed family of recursively enumerable sets. A complete description of all possible subcases is obtained.
scientific article; zbMATH DE number 536686
scientific article