Abstract computational complexity and cycling computations

摘要

A weakening of Blum's Axioms for abstract computational complexity is introduced in order to take into a better account measures that can be finite even when the computations diverge. How the new axioms affect the theory and how they can be used to get an insight in the theory of computations using a finite amount of resource, is shown.