Is there an Elegant Universal Theory of Prediction?
<|reference_start|>Is there an Elegant Universal Theory of Prediction?: Solomonoff's inductive learning model is a powerful, universal and highly elegant theory of sequence prediction. Its critical flaw is that it is incomputable and thus cannot be used in practice. It is sometimes suggested that it may still be useful to help guide the development of very general and powerful theories of prediction which are computable. In this paper it is shown that although powerful algorithms exist, they are necessarily highly complex. This alone makes their theoretical analysis problematic, however it is further shown that beyond a moderate level of complexity the analysis runs into the deeper problem of Goedel incompleteness. This limits the power of mathematics to analyse and study prediction algorithms, and indeed intelligent systems in general.<|reference_end|>
@article{legg2006is,
    title={Is there an Elegant Universal Theory of Prediction?},
    author={Shane Legg},
    journal={arXiv preprint arXiv:cs/0606070},
    year={2006},
    number={IDSIA - 12 - 06},
    archivePrefix={arXiv},
    eprint={cs/0606070},
    primaryClass={cs.AI cs.CC}
}