Asymptotic Complexity of Algorithms via the Nonsymmetric Hausdorff Distance

The theory of nonsymmetric topology has been successfully applied to the theory of complexity of algorithms. In 1995, Schellekens introduced a quasi-pseudo-metric space in order to obtain a mathematical model for the study of complexity of algorithms. Here, we provide a mathematical context to study the asymptotic complexity of algorithms.