Algorithmic complexity of recursive and inductive algorithms (Q1434367)
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 recursive and inductive algorithms |
scientific article; zbMATH DE number 2081196
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithmic complexity of recursive and inductive algorithms |
scientific article; zbMATH DE number 2081196 |
Statements
Algorithmic complexity of recursive and inductive algorithms (English)
0 references
4 August 2004
0 references
Efficiency
0 references
Complexity
0 references
Dual complexity measure
0 references
Kolmogorov complexity
0 references
Recursive algorithm
0 references
Turing machine
0 references
Super-recursive algorithm
0 references
Inductive Turing machine
0 references
0.7770471572875977
0 references
0.7545521855354309
0 references
