Complexity properties of recursively enumerable sets and \(bsQ\)-completeness (Q5942014)
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 bsQ-completeness |
scientific article; zbMATH DE number 1637741
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity properties of recursively enumerable sets and \(bsQ\)-completeness |
scientific article; zbMATH DE number 1637741 |
Statements
Complexity properties of recursively enumerable sets and \(bsQ\)-completeness (English)
0 references
4 March 2003
0 references
The notions of boundedly strongly effectively speedable set and boundedly effectively speedable set are introduced. It is proved that the notions of boundedly strongly effectively speedable set, boundedly effectively speedable set, creative set, and \(bsQ\)-complete recursively enumerable set are equivalent.
0 references
effectively speedable set
0 references
reducibility
0 references
recursively enumerable set
0 references
0.9713898
0 references
0.9203839
0 references
0.90880364
0 references
0.9067116
0 references
0.89265066
0 references
0.8912587
0 references
0 references
