A Machine-Independent Theory of the Complexity of Recursive Functions
Journal of the ACM (JACM)
Toward a Theory of Enumerations
Journal of the ACM (JACM)
Complexity classes of partial recursive functions (Preliminary Version)
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Unsolvability considerations in computational complexity
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Classes of computable functions defined by bounds on computation: Preliminary Report
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Hard-core theorems for complexity classes
Journal of the ACM (JACM)
Ordinal Hierarchies and Naming Complexity Classes
Journal of the ACM (JACM)
On Almost Everywhere Complex Recursive Functions
Journal of the ACM (JACM)
Structure of complexity in the weak monadic second-order theories of the natural numbers
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
On the Efficiency of Universal Machines
IEEE Transactions on Computers
The intensional content of Rice's theorem
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Learning recursive functions: A survey
Theoretical Computer Science
Journal of Computer and System Sciences
Complexity classes of partial recursive functions
Journal of Computer and System Sciences
On the amount of nonconstructivity in learning recursive functions
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
| Hi-index | 0.01 |