Algorithmic complexity of algebraic systems (Q1121875)
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: Algorithmic complexity of algebraic systems |
scientific article; zbMATH DE number 4104939
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithmic complexity of algebraic systems |
scientific article; zbMATH DE number 4104939 |
Statements
Algorithmic complexity of algebraic systems (English)
0 references
1988
0 references
See the review in Zbl 0664.03032.
0 references
construcible structure
0 references
classification of algebraic systems by Turing degrees of unsolvability
0 references
degree of constructibility
0 references
m-degrees of recursively enumerable sets
0 references
strong constructibility
0 references
