Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
A Machine-Independent Theory of the Complexity of Recursive Functions
Journal of the ACM (JACM)
Speed-ups by changing the order in which sets are enumerated (Preliminary Version)
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Optimization Among Provably Equivalent Programs
Journal of the ACM (JACM)
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Type two computational complexity
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
The intensional content of Rice's theorem
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Speed-Up Theorems in Type-2 Computation
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Theory of computing in computer science education
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Strategies for learning search control rules: an explanation-based approach
IJCAI'87 Proceedings of the 10th international joint conference on Artificial intelligence - Volume 1
Completely self-referential optimal reinforcement learners
ICANN'05 Proceedings of the 15th international conference on Artificial neural networks: formal models and their applications - Volume Part II
Turing machine-inspired computer science results
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
| Hi-index | 0.00 |