A Machine-Independent Theory of the Complexity of Recursive Functions
Journal of the ACM (JACM)
Classes of computable functions defined by bounds on computation: Preliminary Report
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Hi-index | 0.01 |
Some consequences of Blum's axioms for step counting functions are investigated. Blum has suggested in [1, p. 335] that for the operation of self-composition there is no strong gap, i.e.,@?j[t(x)