Next: Computable Predictions
Up: Speed PriorBased Inductive Inference
Previous: Algorithm GUESS
Close Approximation of the Speed Prior
The precise value of is only computable in the limit.
However, within finite
time we can compute with arbitrary precision.
There is a halting algorithm
AS
that takes as input and
some , and outputs an approximation
such that

(6) 
AS
works as follows:
Algorithm AS:
1.
Run FAST
until is computed for the first time in PHASE .
Let denote the size of the smallest program for
found in this PHASE.
3.
Set
equal to the sum of the
contributions to of all programs of all
PHASEs up to the PHASE with number
AS halts after step 3 since
any additional PHASEs are superfluous
in the following sense: even if all their
programs computed ,
their cumulative contributions to
could not exceed .
Next: Computable Predictions
Up: Speed PriorBased Inductive Inference
Previous: Algorithm GUESS
Juergen Schmidhuber
20030225
Back to Speed Prior page