Abstract
Robustness and algorithmic complexity
John Doyle
California Institute of Technology
Much effort has gone towards attempts to connect algorithmic complexity with phase transition phenomena from statistical physics. This talk will offer a radically different perspective linking complexity with model fragility and ill-conditioning. This approach not only has greater explanatory power regarding existing issues, but has led to new classes of algorithms that seem remarkably effective on problems of practical interest.
No video available