Algorithmic complexity as a criterion of unsolvability (Q2383595)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5192267
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithmic complexity as a criterion of unsolvability |
scientific article; zbMATH DE number 5192267 |
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
0.7770471572875977
0 references
0.76025390625
0 references
0.7530779242515564
0 references
0.7481235861778259
0 references
