Generic predictions of output probability based on complexities of inputs and outputs
For a broad class of input-output maps, arguments based on the coding theorem from algorithmic information theory (AIT) predict that simple (low Kolmogorov complexity) outputs are exponentially more likely to occur upon uniform random sampling of inputs than complex outputs are. Here, we derive prob...
| Autors principals: | , , |
|---|---|
| Format: | Journal article |
| Idioma: | English |
| Publicat: |
Nature Research
2020
|