The number of nonequivalent computable indexations for a fixed family of sets (Q1317638)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The number of nonequivalent computable indexations for a fixed family of sets |
scientific article; zbMATH DE number 536686
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The number of nonequivalent computable indexations for a fixed family of sets |
scientific article; zbMATH DE number 536686 |
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
0.91266084
0 references
0.8950025
0 references
0 references
0.8881145
0 references
0.88311046
0 references
0 references
0.88299865
0 references
