On approximate decidability of minimal programs (Q2828213)
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 6642911
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On approximate decidability of minimal programs |
scientific article; zbMATH DE number 6642911 |
Statements
24 October 2016
0 references
frequency computation
0 references
Kolmogorov complexity
0 references
list approximations
0 references
minimal indices
0 references
numberings
0 references
0 references
On approximate decidability of minimal programs (English)
0 references
0.7953546643257141
0 references
0.7953546643257141
0 references
0.786693274974823
0 references
0.7580286264419556
0 references
