Algorithmic complexity as a criterion of unsolvability (Q2383595): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q1684626 |
||
| Property / author | |||
| Property / author: Mark S. Burgin / rank | |||
Revision as of 06:44, 29 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
