Publisher
Springer Berlin Heidelberg
Reference30 articles.
1. Blum, M., “A machine-independent theory of the complexity of recursive functions,” J, ACM 14 (1967) pp. 322‐336.
2. Blum, M., and Marques, I., “On complexity properties of recursively enumerable sets,” J. Symbolic Logic 38 (1973) 579–593.
3. Borodin, A. , “Computational complexity and the existence of complexity gaps,” J. ACM 19 (1972) 185‐194.
4. Constable, R., “The operator gap,” J. ACM 19 (1972) 175‐183.
5. Davis, M., Computability and Unsolvability, McGraw-Hill (1958), New York, N. Y.