Next: Summary
Up: OOPS on Universal Computers
Previous: Essential Properties of OOPS
Given an optimal problem solver such as OOPS, problem ,
current code bias
,
the most recent start address ,
and information about the starts and ends of previously
frozen programs
,
the total search time
for solving can be used to define the degree of
bias
The smaller the bias, the longer the search time of
any bias-optimal searcher.
Compare the concept of conceptual jump size
(Solomonoff, [69,70]).
Juergen Schmidhuber
2004-04-15
Back to OOPS main page