Algorithmic complexity as a criterion of unsolvability (Q2383595): 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.2007.04.011 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1997448562 / rank | |||
Normal rank | |||
Revision as of 23:22, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithmic complexity as a criterion of unsolvability |
scientific article |
Statements
Algorithmic complexity as a criterion of unsolvability (English)
0 references
19 September 2007
0 references
Kolmogorov complexity
0 references
recursive algorithmic complexity
0 references
inductive Turing machine
0 references
algorithmic problem
0 references
inductive algorithmic complexity
0 references
decidability
0 references
super-recursive algorithm
0 references
