| Autor: |
Kamaludin Dingle, Chico Q. Camargo, Ard A. Louis |
| Jazyk: |
angličtina |
| Rok vydání: |
2018 |
| Předmět: |
|
| Zdroj: |
Nature Communications, Vol 9, Iss 1, Pp 1-7 (2018) |
| Druh dokumentu: |
article |
| ISSN: |
2041-1723 |
| DOI: |
10.1038/s41467-018-03101-6 |
| Popis: |
Algorithmic information theory measures the complexity of strings. Here the authors provide a practical bound on the probability that a randomly generated computer program produces a given output of a given complexity and apply this upper bound to RNA folding and financial trading algorithms. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
