Computational Complexity, Dynamical Systems, and Non-Convex Optimization For a given computational problem, computational complexity asks the question of the resources needed - such as time, space, energy - by any algorithm which solves the problem. Despite algorithms being a form of discrete dynamical system (in both time & space), the...