Algorithmic complexity of recursive and inductive algorithms (Q1434367): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2003.12.003 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2003.12.003 / rank | |||
Normal rank | |||
Latest revision as of 20:25, 10 December 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
