Towards an algorithmic theory of robustness

Let Σ be the set of stable linear time invariant autonomous systems, equipped with a stability robustness measure ρ. Let 𝒯 _𝒜 be the measure of the computational efficiency of the algorithm 𝒜that verifies the stability of the elements of Σ. We demonstrate the existence of a natural robustness measure ρ, algorithm 𝒜, and a monotonically increasing function h, such that for all stable 𝒮∈Σ