FAST & universal search (II)
In phase i=1,2,3… execute all programs p with -logP(p) + log t(p) = i.
Bit programs: size(p) + lg t(p) = i.
First applications : Schmidhuber, ICML 95, Neural Networks 97, Schmidhuber & Wiering & Schraudolph, ICML 97, MLJ 97
Hutter’s more complex optimal algorithm for all well-defined problems (2000): constant factor ə+? ! Additive unknown constant :-(
Back to J. Schmidhuber's Speed Prior page