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.
- Kamaludin Dingle
- Chico Q. Camargo
- Ard A. Louis
