Algorithmic complexity of recursive and inductive algorithms (Q1434367): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2003.12.003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2007412164 / rank | |||
Normal rank | |||
Revision as of 20:31, 19 March 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
