Complexity properties of recursively enumerable sets and \(sQ\)-completeness (Q1277538)
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: Complexity properties of recursively enumerable sets and \(sQ\)-completeness |
scientific article; zbMATH DE number 1257040
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity properties of recursively enumerable sets and \(sQ\)-completeness |
scientific article; zbMATH DE number 1257040 |
Statements
Complexity properties of recursively enumerable sets and \(sQ\)-completeness (English)
0 references
10 October 1999
0 references
In the paper under review the author defines classes of effective subcreative and effective speedable sets as natural ``effective versions'' of classes of subcreative and speedable sets accordingly. It is proved that these two classes of sets coincide with the class of \(sQ\)-complete recursively enumerable sets.
0 references
recursively enumerable sets
0 references
effective subcreative sets
0 references
\(Q\)-complete sets
0 references
effective speedable sets
0 references
