PPT Slide
Time-optimal planning in program space (not in raw solution space!)
Branches of search tree are program prefixes (width = history dependent token probabilities)
Node-oriented backtracking
restores task sets and tapes (including newly computed distributions) on error or when ? t > PT
Back to J. Schmidhuber's OOPS page