zbMATH — the first resource for mathematics

Abstract computational complexity and cycling computations. (English) Zbl 0225.02025

03D15 Complexity of computation (including implicit computational complexity)
Full Text: DOI
[1] Blum, M., A machine-independent theory of the complexity of recursive functions, J. of ACM, 14, 2, 322-366, (1967) · Zbl 0155.01503
[2] Rogers, H., ()
[3] Ausiello, G., Parallel universal computation, ()
[4] Borodin, A., Complexity classes of recursive functions and the existence of complexity gaps, () · Zbl 0261.68024
[5] Meyer, A.R.; McCreight, E.M., Classes of computable functions defined by bounds on computations, () · Zbl 1283.03074
[6] Ausiello, G., On bounds on the number of steps to computer functions, ()
[7] Constable, R., Upward and downward diagonalization over axiomatic complexity classes, ()
[8] Landweber, L.H.; Robertson, E.L., Recursive properties of abstract complexity classes, () · Zbl 0261.68025
[9] Lewis, F.D., Decision problems for complexity classes of computable functions, () · Zbl 0215.04701
[10] Havel, I.M., Weak complexity measures, ()
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.