Recursively enumerable sets and degrees. A study of computable functions and computably generated sets. Translated from the English. Translation edited and with a preface by M. M. Arslanov. (Q2735600)
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: Recursively enumerable sets and degrees. A study of computable functions and computably generated sets. Translated from the English. Translation edited and with a preface by M. M. Arslanov. |
scientific article; zbMATH DE number 1640648
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recursively enumerable sets and degrees. A study of computable functions and computably generated sets. Translated from the English. Translation edited and with a preface by M. M. Arslanov. |
scientific article; zbMATH DE number 1640648 |
Statements
3 September 2001
0 references
recursively enumerable sets
0 references
recursively enumerable degrees
0 references
Post's problem
0 references
oracle
0 references
finite injury priority method
0 references
infinite injury priority method
0 references
minimal pair method
0 references
lattice of r.e. sets
0 references
degree of information
0 references
Recursively enumerable sets and degrees. A study of computable functions and computably generated sets. Translated from the English. Translation edited and with a preface by M. M. Arslanov. (English)
0 references
See the reviews of the original edition (Berlin: Springer-Verlag) (1987) in Zbl 0623.03042 and Zbl 0667.03030.
0 references
