Input–output maps are strongly biased towards simple outputs
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.
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Nature Publishing Group
2018-02-01
|
| Series: | Nature Communications |
| Online Access: | https://doi.org/10.1038/s41467-018-03101-6 |