PPT Slide
Search one code for many tasks. Prefix
qn solves earlier tasks; stored in non-
modifiable memory; may call or copy-edit
previous qi (i<n). Spend half the time on
programs starting at alast , half on afrozen+1!
One tape per task (modifiable memory).
(Here: 5 tapes with negative addresses)
Code may write more executable code
onto tapes; prefixes may rewrite P on
suffixes (yellow on tapes), thus rewriting
search procedure: metasearching
Task-specific prefix codes: Prolong code
by one token once current task requests
this; use current task’s tape-encoded
Token-oriented backtracking restores
partially solved task sets and modified
tapes on error or when t > PT
Back to J. Schmidhuber's OOPS page