The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Steps toward Artificial Intelligence
Abstract
The problems of heuristic programming-of making computers solve really difficult problems-are divided into five main areas: Search, Pattern-Recognition, Learning, Planning, and Induction. A computer can do, in a sense, only what it is told to do. But even when we do not know how to solve a certain problem, we may program a machine (computer) to Search through some large space of solution attempts. Unfortunately, this usually leads to an enormously inefficient process. With Pattern-Recognition techniques, efficiency can often be improved, by restricting the application of the machine's methods to appropriate problems. Pattern-Recognition, together with Learning, can be used to exploit generalizations based on accumulated experience, further reducing search. By analyzing the situation, using Planning methods, we may obtain a fundamental improvement by replacing the given search with a much smaller, more appropriate exploration. To manage broad classes of problems, machines will need to construct models of their environments, using some scheme for Induction. Wherever appropriate, the discussion is supported by extensive citation of the literature and by descriptions of a few of the most successful heuristic (problem-solving) programs constructed to date.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Chomsky, N. (1957) · doi:10.1515/9783112316009 · Cited by 7,885
Plans and the structure of behavior.
Miller, G. A., Galanter, E., & Pribram, K. H. (1960) · doi:10.1037/10039-000 · Cited by 4,630
Some Studies in Machine Learning Using the Game of Checkers
Samuel, A. L. (1959) · IBM Journal of Research and Development · doi:10.1147/rd.33.0210 · Cited by 4,443
A Computing Procedure for Quantification Theory
Davis, M., & Putnam, H. (1960) · Journal of the ACM · doi:10.1145/321033.321034 · Cited by 2,647
What the frog's eye tells the frog's brain
Lettvin, J., Maturana, H., McCulloch, W., & Pitts, W. (1959) · Proceedings of the IRE · doi:10.1109/jrproc.1959.287207 · Cited by 1,990
How to Solve It: A New Aspect of Mathematical Method
Polya, G. (1945) · Princeton University Press eBooks · doi:10.1515/9781400828678 · Cited by 1,652
Stochastic models for learning.
Bush, R. R., & Mosteller, F. (1955) · John Wiley & Sons, Inc. eBooks · doi:10.1037/14496-000 · Cited by 1,511
Elements of a theory of human problem solving.
Newell, A., Shaw, J. C., & Simon, H. A. (1958) · Psychological Review · doi:10.1037/h0048495 · Cited by 1,380
The Synthesis of Two-Terminal Switching Circuits
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb03624.x · Cited by 802
How we know universals the perception of auditory and visual forms
Pitts, W., & McCulloch, W. S. (1947) · The Bulletin of Mathematical Biophysics · doi:10.1007/bf02478291 · Cited by 799
Chomsky, N., & Miller, G. A. (1958) · Information and Control · doi:10.1016/s0019-9958(58)90082-2 · Cited by 383
Friedberg, R. M. (1958) · IBM Journal of Research and Development · doi:10.1147/rd.21.0002 · Cited by 373
Wang, H. (1960) · IBM Journal of Research and Development · doi:10.1147/rd.41.0002 · Cited by 331
Chess-Playing Programs and the Problem of Complexity
Newell, A., Shaw, J. C., & Simon, H. A. (1958) · IBM Journal of Research and Development · doi:10.1147/rd.24.0320 · Cited by 321
Simulation of self-organizing systems by digital computer
Farley, B., & Clark, W. (1954) · Transactions of the IRE Professional Group on Information Theory · doi:10.1109/tit.1954.1057468 · Cited by 270
Pattern Recognition by Machine
Selfridge, O. G., & Neisser, U. (1960) · Scientific American · doi:10.1038/scientificamerican0860-60 · Cited by 241
Empirical explorations of the logic theory machine: a case study in heuristic
Newell, A., Shaw, J. C., & Simon, H. A. (1957) · Papers presented at the February 26-28, 1957, western joint computer conference: Techniques for reliability on - IRE-AIEE-ACM '57 (Western) · doi:10.1145/1455567.1455605 · Cited by 236
Friedberg, R. M., Dunham, B., & North, J. (1959) · IBM Journal of Research and Development · doi:10.1147/rd.33.0282 · Cited by 212
Intelligent Behavior in Problem-Solving Machines
Gelernter, H. L., & Rochester, N. (1958) · IBM Journal of Research and Development · doi:10.1147/rd.24.0336 · Cited by 105
A system for the automatic recognition of patterns
Grimsdale, R. L., Sumner, F. H., Tunis, C. J., & Kilburn, T. (1959) · Proceedings of the IEE Part B Electronic and Communication Engineering · doi:10.1049/pi-b-2.1959.0287 · Cited by 84
An introduction to information processing language V
Newell, A., & Tonge, F. M. (1960) · Communications of the ACM · doi:10.1145/367177.367205 · Cited by 51
A chess playing program for the IBM 704
Bernstein, A. J., Arbuckle, T., Roberts, M. D. V., & Belsky, M. (1958) · AFIPS Spring Joint Computer Conference (SJCC) · doi:10.1145/1457769.1457813 · Cited by 47
Hohn, F. E., Seshu, S., & Aufenkamp, D. D. (1957) · IEEE Transactions on Electronic Computers · doi:10.1109/tec.1957.5222012 · Cited by 44
Research works printed but not linked: 50
- haller, 1959, Line Tracing for Character Recognition
- kohler, 1947, Gestalt Psychology
- 1956, Proc Third London Symp Information Theory
- 10.1108/eb049574 · doi:10.1108/eb049574
- hebb, 1949, The Organization of Behavior
- holland, 1960, On iterative circuit computers constructed of microelectronic components and systems, Proc WJCC, 259
- 10.1109/JRPROC.1959.287109 · doi:10.1109/jrproc.1959.287109
- 1955, Proc WJCC
- kirsch, 1957, Experiments in Processing Pictorial Information with a Digital Computer, Proc EJCC, 221
- 0, Fourth London Symp on Information Theory
- rosenblatt, 1958, Perceptrons
- 10.1109/TEC.1960.5219829 · doi:10.1109/tec.1960.5219829
- doyle, 1959, Recognition of Sloppy Hand-Printed Characters
- roberts, 0, Pattern recognition with an adaptive network, 1960 IRE International Convention Record, 66
- bellman, 1957, Dynamic Programming
- darlington, 1958, Evolutionary Genetics
- 1959, Proc Symp on Mechanisation of Thought Processes
- solomonoff, 0, An inductive inference machine, 1957 IRE National Convention Record, 56
- freimer, 1960, Topics in Dynamic Programming II
- minot, 1959, Automatic Devices for Recognition of Visible Two-Dimensional Patterns A Survey of the Field
- ashby, 1952, Design for a Brain
- 1956, Automata Studies
- minsky, 1954, Neural nets and the brain-model problem
- tinbergen, 1951, The Study of Instinct
- stevens, 1957, A Survey of Automatic Reading Techniques
- skinner, 1953, Science and Human Behavior
- 1954, Patterns of Plausible Inference, 2
- 1956, The World of Mathematics, 4
- rosenbloom, 1951, Elements of Mathematical Logic
- moore, 1959, On the shortest path through a maze, Proc Internatl Symp on the Theory of Switching
- craik, 1952, The Nature of Explanation
- 10.2307/2308962 · doi:10.2307/2308962
- 1959, Proc Internatl Conf on Information Processing
- 10.1093/bjps/V.17.18 · doi:10.1093/bjps/v.17.18
- hayek, 1952, The sensory order
- 1956, IRE Trans on Information theory, if 2
- 10.1016/0016-0032(55)90186-1 · doi:10.1016/0016-0032(55)90186-1
- 1960, Self-Organizing Systems
- slagle, 0, A computer program for solving problems in 'Freshman Calculus
- 1960, Commun ACM, 3
- rashevsky, 1960, Mathematical Biophysics, 2
- samuel, 1960, Letter to the Editor, Science, 132
- 10.1109/3468.568739 · doi:10.1109/3468.568739
- minsky, 1956, Heuristic Aspects of the Artificial Intelligence Problem
- solomonoff, 1958, The Mechanization of Linguistic Learning
- solomonoff, 1960, A Preliminary Report on a General Theory of Inductive Inference, Zator Tech Bull, 131
- 10.1016/S0019-9958(59)90215-3 · doi:10.1016/s0019-9958(59)90215-3
- 1959, Proc EJCC
- 10.1287/mnsc.6.4.455 · doi:10.1287/mnsc.6.4.455
- bruner, 1956, A Study of Thinking
Cited by
Deep learning in neural networks: an overview
Schmidhuber, J. (2015) · Neural Networks · doi:10.1016/j.neunet.2014.09.003 · Cited by 18,570
Visual pattern recognition by moment invariants
Hu, M.-K. (1962) · IEEE Transactions on Information Theory · doi:10.1109/tit.1962.1057692 · Cited by 7,546
Bayesian Networks and Decision Graphs
Jensen, F. V., & Nielsen, T. D. (2007) · Information Science and Statistics · doi:10.1007/978-0-387-68282-2 · Cited by 4,129
Statistical physics of social dynamics
Castellano, C., Fortunato, S., & Loreto, V. (2009) · Reviews of Modern Physics · doi:10.1103/revmodphys.81.591 · Cited by 4,119
Some Philosophical Problems from the Standpoint of Artificial Intelligence
McCarthy, J., & Hayes, P. J. (1981) · Readings in Artificial Intelligence · doi:10.1016/b978-0-934613-03-3.50033-7 · Cited by 3,279
Metadata
- Authors
- Minsky, M.
- Venue
- Proceedings of the IRE
- Published
- 1961-01
- Volume
- 49
- Issue
- 1
- Pages
- 8-30
- ISSN
- 0096-8390 (ISSN-L)
- 2162-6634
- OpenAlex
- W205043379
- Cited by
- 1,675
- References
- 23
- FWCI
- 38.00
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.