Fast reusable paths that can still be reopened

How can a reusable abstraction make future work cheaper without making correction prohibitively difficult?

Formülasyon

Treat memory as both a computational resource and a constraint: recurrent paths can be shortened, but exceptions, reverse paths, and opportunities for restructuring must remain accessible.

Gerilim

The map that makes action fast can make revision difficult.

Açık soru

What evidence triggers reopening a shortcut rather than fitting new cases into it?