Algorithmic complexity as a criterion of unsolvability (Q2383595): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:46, 2 February 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
