The number of nonequivalent computable indexations for a fixed family of sets (Q1317638)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The number of nonequivalent computable indexations for a fixed family of sets |
scientific article |
Statements
The number of nonequivalent computable indexations for a fixed family of sets (English)
0 references
12 April 1994
0 references
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.
0 references
reducibility
0 references
computable indexations
0 references
recursively enumerable sets
0 references
