• DocumentCode
    1542286
  • Title

    How a computer system can learn

  • Author

    Hormann, Aiko

  • Author_Institution
    System Development Corporation
  • Volume
    1
  • Issue
    7
  • fYear
    1964
  • fDate
    7/1/1964 12:00:00 AM
  • Firstpage
    110
  • Lastpage
    119
  • Abstract
    The process by which a computer can learn is demonstrated by asking it to solve increasingly more difficult versions of the Tower of Hanoi puzzle. Ultimately, the system may learn how to generalize in a particular problem domain Present uses of computers, valuable as they may be, are far from the ultimate in what might be accomplished. One of the reasons is that the solution of even well-defined problems, for which goals and rules are precisely known, can be extremely difficult to program (e.g., chess-playing programs). But intellectual capacities of machines might be extended by means of an adaptive system to handle increasingly complex and varied tasks.
  • fLanguage
    English
  • Journal_Title
    Spectrum, IEEE
  • Publisher
    ieee
  • ISSN
    0018-9235
  • Type

    jour

  • DOI
    10.1109/MSPEC.1964.6500740
  • Filename
    6500740