Leonid A. Levin

Climbing algorithms (invited talk)

2021

NP (search) problems allow easy correctness tests for solutions. Climbing algorithms allow also easy assessment of how close to yielding the correct answer is the configuration at any stage of their run. This offers a …