Turing Award lecture on computational complexity and the nature of computer science
- 1 October 1994
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 37 (10) , 37-43
- https://doi.org/10.1145/194313.214781
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- IP = PSPACEJournal of the ACM, 1992
- The Mythical Man-MonthPublished by Association for Computing Machinery (ACM) ,1975
- Relationships between nondeterministic and deterministic tape complexitiesJournal of Computer and System Sciences, 1970
- A Machine-Independent Theory of the Complexity of Recursive FunctionsJournal of the ACM, 1967
- Recognition and parsing of context-free languages in time n3Information and Control, 1967
- On the computational complexity of algorithmsTransactions of the American Mathematical Society, 1965
- A. M. Turing. On computable numbers, with an application to the Entscheidungs problcm. Proceedings of the London Mathematical Society, 2 s. vol. 42 (1936–1937), pp. 230–265.The Journal of Symbolic Logic, 1937