Algorithmic complexity of recursive and inductive algorithms (Q1434367): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q797989 |
Changed an Item |
||
| Property / author | |||
| Property / author: Mark S. Burgin / rank | |||
Normal rank | |||
Revision as of 06:45, 21 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithmic complexity of recursive and inductive algorithms |
scientific article |
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
