Most cited papers in Computability, Logic, AI Algorithms
What are the most cited papers in Computability, Logic, AI Algorithms?
The most cited paper in Computability, Logic, AI Algorithms is "New directions in cryptography" (Whitfield Diffie, Martin E. Hellman, 1976), with 14,610 citations. Next come "Quantum cryptography based on Bell’s theorem" (10,906) and "I.—COMPUTING MACHINERY AND INTELLIGENCE" (10,076).
Showing 50 of 97 papers. Every paper with more than 1,044 citations is listed.
| # | Paper | ||
|---|---|---|---|
| 1 | New directions in cryptography Whitfield Diffie, Martin E. Hellman · IEEE Transactions on Information Theory | Nov 1976 | 14,610 |
| 2 | Quantum cryptography based on Bell’s theorem ARTUR K. EKERT · Physical Review Letters | 5 Aug 1991 | 10,906 |
| 3 | I.—COMPUTING MACHINERY AND INTELLIGENCE Alan Mathison Turing · Mind | Oct 1950 | 10,076 |
| 4 | A fast quantum mechanical algorithm for database search Lov K. Grover | 1996 | 8,851 |
| 5 | Communication and Concurrency Robin Milner | 1989 | 6,871 |
| 6 | Minds, brains, and programs John Rogers Searle · Behavioral and Brain Sciences | Sep 1980 | 6,674 |
| 7 | The complexity of theorem-proving procedures Stephen A Cook | 1971 | 6,257 |
| 8 | Computing Machinery and Intelligence (1950) Alan Mathison Turing | 9 Sep 2004 | 6,187 |
| 9 | Information Theory and Reliable Communication. P. M. Lee, Robert T. Gallager · Journal of the Royal Statistical Society Series A (General) | 1970 | 5,587 |
| 10 | Plans and Situated Actions: The Problem of Human-Machine Communication Barry H. Kantowitz, Lucy A. Suchman · The American Journal of Psychology | 1990 | 5,324 |
| 11 | Random oracles are practical Mihir Bellare, Phillip Rogaway | 1993 | 4,745 |
| 12 | Quantum theory, the Church–Turing principle and the universal quantum computer David Deutsch · Proceedings of the Royal Society of London A Mathematical and Physical Sciences | 8 Jul 1985 | 4,661 |
| 13 | A Theory of the Learnable Leslie Gabriel Valiant · ACM eBooks | 1984 | 4,219 |
| 14 | Connectionism and cognitive architecture: A critical analysis Jerry A. Fodor, Zenon W. Pylyshyn · Cognition | Mar 1988 | 4,072 |
| 15 | An axiomatic basis for computer programming C. A. R. Hoare · Communications of the ACM | Oct 1969 | 3,964 |
| 16 | Logical Reversibility of Computation C. H. Bennett · IBM Journal of Research and Development | Nov 1973 | 3,735 |
| 17 | Reasoning about knowledge Joseph Halpern · Mathematical Social Sciences | Dec 1994 | 3,587 |
| 18 | How to play ANY mental game Oded Goldreich, Silvio Micali, Avi Wigderson | 1987 | 3,577 |
| 19 | Compression of individual sequences via variable-rate coding J. Ziv, Abraham Lempel · IEEE Transactions on Information Theory | Sep 1978 | 3,474 |
| 20 | Some Philosophical Problems from the Standpoint of Artificial Intelligence John McCarthy, Patrick J. Hayes · Elsevier eBooks | 1981 | 3,307 |
| 21 | The Knowledge Complexity of Interactive Proof Systems Shafi Goldwasser, Silvio Micali, Charles Rackoff · SIAM Journal on Computing | Feb 1989 | 3,305 |
| 22 | Protocols for secure computations Andrew Chi-Chih Yao | Nov 1982 | 3,089 |
| 23 | Understanding Machine Learning: From Theory To Algorithms Shai Shalev‐Shwartz, Shai Ben-David | 2015 | 3,076 |
| 24 | On the Complexity of Finite Sequences Abraham Lempel, J. Ziv · IEEE Transactions on Information Theory | 1976 | 2,784 |
| 25 | A Computing Procedure for Quantification Theory Martin D. Davis, Hilary Putnam · Journal of the ACM | Jul 1960 | 2,643 |
| 26 | Can programming be liberated from the von Neumann style? John Backus · Communications of the ACM | Aug 1978 | 2,613 |
| 27 | Computation: Finite and Infinite Machines. D. A. Clarke, Marvin Minsky · American Mathematical Monthly | Apr 1968 | 2,612 |
| 28 | Theory of Recursive Functions and Effective Computability D. Craig Cooper · The Computer Journal | Feb 1969 | 2,581 |
| 29 | The knowledge level Allen Newell · Artificial Intelligence | 1982 | 2,505 |
| 30 | Computational Complexity: A Modern Approach Sanjeev Arora, Boaz Barak | 20 Apr 2009 | 2,401 |
| 31 | GPT-3: Its Nature, Scope, Limits, and Consequences Luciano Floridi, Massimo Chiriatti · Minds and Machines | Nov 2020 | 2,384 |
| 32 | Computer science as empirical inquiry Allen Newell, Herbert A. Simon · Communications of the ACM | Mar 1976 | 2,345 |
| 33 | Computational Complexity Peter Brucker | 1995 | 2,302 |
| 34 | How to construct random functions Oded Goldreich, Shafi Goldwasser, Silvio Micali · Journal of the ACM | 10 Aug 1986 | 2,133 |
| 35 | A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem Edward Farhi, Jeffrey Goldstone, Sam Gutmann et al. · Science | 20 Apr 2001 | 2,104 |
| 36 | RESTRUCTURING LATTICE THEORY: AN APPROACH BASED ON HIERARCHIES OF CONCEPTS Rudolf Wille · Lecture notes in computer science | 2009 | 2,092 |
| 37 | Probabilistic machine learning and artificial intelligence Zoubin Ghahramani · Nature | 26 May 2015 | 2,047 |
| 38 | Theory of Recursive Functions and Effective Computability Jr. Hartley Rogers · CERN Document Server (European Organization for Nuclear Research) | 22 Apr 1987 | 2,006 |
| 39 | Universality and complexity in cellular automata Stephen Wolfram · Physica D Nonlinear Phenomena | 1984 | 1,944 |
| 40 | The small-world phenomenon Jon Kleinberg | May 2000 | 1,916 |
| 41 | Quantum computation and quantum information Thierry Paul · Mathematical Structures in Computer Science | 23 Nov 2007 | 1,908 |
| 42 | Man-Computer Symbiosis J. C. R. Licklider · IRE transactions on human factors in electronics | Mar 1960 | 1,866 |
| 43 | Learnability and the Vapnik-Chervonenkis dimension Anselm Blumer, Andrzej Ehrenfeucht, David H. Haussler et al. · Journal of the ACM | Oct 1989 | 1,858 |
| 44 | The Google Similarity Distance Rudi Cilibrasi, Paul M. B. Vitanyi · IEEE Transactions on Knowledge and Data Engineering | 9 Feb 2007 | 1,772 |
| 45 | Computational thinking and thinking about computing Jeannette M. Wing · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences | 31 Jul 2008 | 1,764 |
| 46 | Boosting a Weak Learning Algorithm by Majority Yoav Freund · Information and Computation | Sep 1995 | 1,694 |
| 47 | Some Computer Organizations and Their Effectiveness Michael J. Flynn · IEEE Transactions on Computers | Sep 1972 | 1,691 |
| 48 | The Lack of A Priori Distinctions Between Learning Algorithms David H. Wolpert · Neural Computation | Oct 1996 | 1,688 |
| 49 | The World’s Technological Capacity to Store, Communicate, and Compute Information Martin Hilbert, Priscila López · Science | 10 Feb 2011 | 1,640 |
| 50 | A Generalized Representer Theorem Bernhard Schölkopf, Ralf Herbrich, Alex J. Smola · Lecture notes in computer science | 2001 | 1,632 |
Citations are OpenAlex's own counts, from its 2026-09-23 snapshot, so the ranking can differ from Google Scholar or Web of Science. A paper is listed for a field when OpenAlex files it under one of the field's topics; retracted papers and papers whose citation count cannot be traced to citing works are left out, and a preprint and the article it became are shown once. Release dates are OpenAlex's: where a source gave only a month or a year, that is what is shown. How the lists are chosen.