Abstract
We analyze the complexity of an expoDC algorithm by deducing the existence of solution for the recurrence inequation associated to this algorithm by means of techniques of Denotational Semantics in the context of fuzzy quasi-metric spaces. The fuzzy quasi-metrics provide an additional parameter “t” such that a suitable use of this ingredient gives rise to extra information on the involved computational process. This analysis is done by means of a fuzzy quasi-metric version of the Banach contraction principle on a space of partial functions endowed by a suitable adaptation of the Baire quasi-metric.