Computable model discovery and high-level-programming approximations to algorithmic complexity (Q2163372)
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 7570312
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computable model discovery and high-level-programming approximations to algorithmic complexity |
scientific article; zbMATH DE number 7570312 |
Statements
Computable model discovery and high-level-programming approximations to algorithmic complexity (English)
0 references
10 August 2022
0 references
Kolmogorov-chaitin complexity
0 references
algorithmic information theory
0 references
algorithmic randomness
0 references
generative model generation
0 references
IMP
0 references
0 references
0.7083402872085571
0 references
0.6769351959228516
0 references
0.6738688945770264
0 references
