Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 1,675

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

Minsky, Marvin · 1961 · Proceedings of the IRE

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/jrproc.1961.287775

Cites

23 of 23 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Research works printed but not linked: 50

  1. haller, 1959, Line Tracing for Character Recognition
  2. kohler, 1947, Gestalt Psychology
  3. 1956, Proc Third London Symp Information Theory
  4. 10.1108/eb049574 · doi:10.1108/eb049574
  5. hebb, 1949, The Organization of Behavior
  6. holland, 1960, On iterative circuit computers constructed of microelectronic components and systems, Proc WJCC, 259
  7. 10.1109/JRPROC.1959.287109 · doi:10.1109/jrproc.1959.287109
  8. 1955, Proc WJCC
  9. kirsch, 1957, Experiments in Processing Pictorial Information with a Digital Computer, Proc EJCC, 221
  10. 0, Fourth London Symp on Information Theory
  11. rosenblatt, 1958, Perceptrons
  12. 10.1109/TEC.1960.5219829 · doi:10.1109/tec.1960.5219829
  13. doyle, 1959, Recognition of Sloppy Hand-Printed Characters
  14. roberts, 0, Pattern recognition with an adaptive network, 1960 IRE International Convention Record, 66
  15. bellman, 1957, Dynamic Programming
  16. darlington, 1958, Evolutionary Genetics
  17. 1959, Proc Symp on Mechanisation of Thought Processes
  18. solomonoff, 0, An inductive inference machine, 1957 IRE National Convention Record, 56
  19. freimer, 1960, Topics in Dynamic Programming II
  20. minot, 1959, Automatic Devices for Recognition of Visible Two-Dimensional Patterns A Survey of the Field
  21. ashby, 1952, Design for a Brain
  22. 1956, Automata Studies
  23. minsky, 1954, Neural nets and the brain-model problem
  24. tinbergen, 1951, The Study of Instinct
  25. stevens, 1957, A Survey of Automatic Reading Techniques
  26. skinner, 1953, Science and Human Behavior
  27. 1954, Patterns of Plausible Inference, 2
  28. 1956, The World of Mathematics, 4
  29. rosenbloom, 1951, Elements of Mathematical Logic
  30. moore, 1959, On the shortest path through a maze, Proc Internatl Symp on the Theory of Switching
  31. craik, 1952, The Nature of Explanation
  32. 10.2307/2308962 · doi:10.2307/2308962
  33. 1959, Proc Internatl Conf on Information Processing
  34. 10.1093/bjps/V.17.18 · doi:10.1093/bjps/v.17.18
  35. hayek, 1952, The sensory order
  36. 1956, IRE Trans on Information theory, if 2
  37. 10.1016/0016-0032(55)90186-1 · doi:10.1016/0016-0032(55)90186-1
  38. 1960, Self-Organizing Systems
  39. slagle, 0, A computer program for solving problems in 'Freshman Calculus
  40. 1960, Commun ACM, 3
  41. rashevsky, 1960, Mathematical Biophysics, 2
  42. samuel, 1960, Letter to the Editor, Science, 132
  43. 10.1109/3468.568739 · doi:10.1109/3468.568739
  44. minsky, 1956, Heuristic Aspects of the Artificial Intelligence Problem
  45. solomonoff, 1958, The Mechanization of Linguistic Learning
  46. solomonoff, 1960, A Preliminary Report on a General Theory of Inductive Inference, Zator Tech Bull, 131
  47. 10.1016/S0019-9958(59)90215-3 · doi:10.1016/s0019-9958(59)90215-3
  48. 1959, Proc EJCC
  49. 10.1287/mnsc.6.4.455 · doi:10.1287/mnsc.6.4.455
  50. bruner, 1956, A Study of Thinking

Cited by

See all 1,675

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.