OOPS: Two near-bias-optimal searches
To find and then freeze pn+1, do in parallel:
SEARCH1: test all prefixes on all tasks ? n+1
SEARCH2: test only prefixes starting with pn, and only on task n+1! (safe because we know such prefixes solve all tasks ? n)
Both searches depth-first: branches of search tree are program prefixes; backtrack (restore tasks and states) once sum of runtimes of current prefix on all current tasks exceeds prefix probability times search time so far.
8-bias-optimal! (OOPS variants: see paper)
Back to J. Schmidhuber's OOPS page