Speed prior

From Wikipedia, the free encyclopedia

Jürgen Schmidhuber's Speed Prior is a complexity measure similar to Kolmogorov complexity, except that it is based on computation speed and not program length. It is based on the fastest way of describing objects (rather than the shortest).

Unlike the traditional measures, the Speed Prior leads to near-optimal computable predictions.

[edit] See also

• Computational complexity theory
• Minimum message length
• Minimum description length

[edit] External links

• Speed Prior web site