Algebraic computability and enumeration models. Recursion theory and descriptive complexity (Q2949142)
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: Algebraic computability and enumeration models. Recursion theory and descriptive complexity |
scientific article; zbMATH DE number 6490921
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algebraic computability and enumeration models. Recursion theory and descriptive complexity |
scientific article; zbMATH DE number 6490921 |
Statements
Algebraic Computability and Enumeration Models (English)
0 references
7 October 2015
0 references
computability
0 references
Turing degrees
0 references
admissibility
0 references
e-degrees
0 references
arithmetical hierarchy
0 references
Kolmogorov complexity
0 references
0.7562111020088196
0 references
0.7365694642066956
0 references
