Jump to content

Allen Newell

From Wikipedia, the free encyclopedia
Allen Newell
Born(1927-03-19)March 19, 1927
DiedJuly 19, 1992(1992-07-19)(aged 65)
Alma materStanford University
Princeton University
Carnegie Mellon University
Known forInformation Processing Language
Logic Theorist
General Problem Solver
Soar
Unified Theories of Cognition
AwardsA.M. Turing Award(1975)
IJCAI Award for Research Excellence(1989)
IEEE Emanuel R. Piore Award(1990)
National Medal of Science(1992)
Louis E. Levy Medal(1992)
Scientific career
FieldsComputer science
Cognitive psychology
InstitutionsCarnegie Mellon University
Doctoral advisorHerbert A. Simon
Doctoral studentsHans Berliner
Stuart Card
John E. Laird
Frank Ritter
Milind Tambe

Allen Newell(March 19, 1927 – July 19, 1992) was an American researcher incomputer scienceandcognitive psychologyat theRAND Corporationand atCarnegie Mellon University'sSchool of Computer Science,Tepper School of Business,and Department of Psychology. He contributed to theInformation Processing Language(1956) and two of the earliestAIprograms, theLogic Theorist(1956) and theGeneral Problem Solver(1957) (withHerbert A. Simon). He was awarded theACM'sA.M. Turing Awardalong withHerbert A. Simonin 1975 for their contributions to artificial intelligence and the psychology of human cognition.[1][2]

Early studies

[edit]

Newell completed his bachelor's degree in physics fromStanfordin 1949. He was a graduate student atPrinceton Universityfrom 1949 to 1950, where he studied mathematics. Due to his early exposure to an unknown field known asgame theoryand the experiences from the study of mathematics, he was convinced that he would prefer a combination of experimental and theoretical research to pure mathematics.

In 1950, he left Princeton and joined theRANDCorporation in Santa Monica where he worked for "a group that was studying logistics problems of the Air Force" (Simon). His work withJoseph Kruskalled to the creation of two theories: A Model for Organization Theory and Formulating Precise Concepts in Organization Theory. Newell eventually earned his PhD from the nowTepper School of Businessat Carnegie Mellon with Herbert Simon serving as his advisor.

Afterwards, Newell "turned to the design and conduct of laboratory experiments on decision making in small groups" (Simon). He was dissatisfied, however, with the accuracy and validity of their findings produced from small-scale laboratory experiments. He joined with fellow RAND teammates John Kennedy, Bob Chapman, and Bill Biel at an Air ForceEarly WarningStation to study organizational processes in flight crews. They received funding from the Air Force in 1952 to build a simulator that would enable them to examine and analyze the interactions in the cockpit related to decision-making and information-handling. From these studies, Newell came to believe thatinformation processingis the central activity in organizations.

Artificial intelligence

[edit]

In September 1954, Newell enrolled in a seminar whereOliver Selfridge"described a running computer program that learned to recognize letters and other patterns" (Simon). This was when Allen came to believe that systems may be created and contain intelligence and have the ability to adapt. With this in mind, Allen, after a couple of months, wrote in 1955The Chess Machine: An Example of Dealing with a Complex Task by Adaptation,which "outlined an imaginative design for a computer program to playchessin humanoid fashion "(Simon).

His work came to the attention of economist (and future nobel laureate)Herbert A. Simon,and, together with programmerJ. C. Shaw,they developed the first trueartificial intelligenceprogram[3](see notes), theLogic Theorist.Newell's work on the program laid the foundations of the field. His inventions included:list processing,the most important programming paradigm used by AI ever since; the application ofmeans-ends analysisto general reasoning (or "reasoning as search" ); and the use ofheuristicsto limit the search space.

They presented the program at theDartmouth conferenceof 1956, an informal gathering of researchers who were interested in simulating intelligence with machines. The conference, now widely considered the "birth of artificial intelligence",[4]was enormously influential and those who attended became the leaders of AI research for the next two decades, Newell included.

Later achievements

[edit]

Newell and Simon formed a lasting partnership. They founded an artificial intelligence laboratory atCarnegie Mellon Universityand produced a series of important programs and theoretical insights throughout the late fifties and sixties. This work included theGeneral Problem Solver,a highly influential implementation ofmeans–ends analysis,and thephysical symbol systems hypothesis,the controversial philosophical assertion that all intelligent behavior could be reduced to the kind of symbol manipulation that Newell's programs demonstrated.

Newell's work culminated in the development of acognitive architectureknown asSoarand hisunified theory of cognition,published in 1990, but their improvement was the objective of his efforts up to his death (one of the last Newell's lettersArchived2011-05-14 at theWayback Machine). The field of cognitive architectures, that he initiated, is still active in both the artificial intelligence and computational cognitive science communities.[5]

Awards and honors

[edit]

TheACM - AAAI Allen Newell Awardwas named in his honor. TheAward for Research Excellenceof theCarnegie Mellon School of Computer Sciencewas also named in his honor.

See also

[edit]

Notes

[edit]

[i]Logic theorist is usually considered the first true AI program, although Arthur Samuel's checkers program was released earlier. Christopher Strachey also wrote a checkers program in 1951[17]

References

[edit]
  1. ^"Allen Newell, 65; Scientist Founded A Computing Field".The New York Times.July 20, 1992.RetrievedNovember 28,2010.
  2. ^Herbert A. Simon."Allen Newell, Biographical Memoirs".United States National Academy of Sciences.RetrievedNovember 28,2010.
  3. ^McCorduck, Pamela (2018).Machines who think: a personal inquiry into the history and prospects of artificial intelligence.An A K Peters book. Boca Raton London New York: CRC Press.ISBN978-1-56881-205-2.
  4. ^Crevier, Daniel(1993).AI: The Tumultuous Search for Artificial Intelligence.New York, NY: BasicBooks. pp. 49–51.ISBN0-465-02997-3.
  5. ^Kotseruba, I.; Tsotsos, JK (2020)."40 years of cognitive architectures: core cognitive abilities and practical applications".Artificial Intelligence Review.53(1): 17–94.doi:10.1007/s10462-018-9646-y.S2CID51888132.
  6. ^"Search Deceased Member Data".United States National Academy of Sciences.RetrievedJuly 16,2011.Search with Newell as last name.
  7. ^"Book of Members, 1780-2010: Chapter N"(PDF).American Academy of Arts and Sciences.RetrievedJuly 16,2011.
  8. ^"A. M. Turing Award".Association for Computing Machinery.Archived fromthe originalon 2009-12-12.RetrievedFebruary 10,2011.
  9. ^"Search Fellows".John Simon Guggenheim Memorial Foundation.Archived fromthe originalon 2012-09-23.RetrievedJuly 18,2011.Search for Newell between 1976 and 1977.
  10. ^"NAE Members Directory - Dr. Allen Newell".United States National Academy of Engineering.RetrievedJanuary 22,2011.
  11. ^"Computer Pioneer Charter Recipients".IEEE Computer Society.Archived fromthe originalon 2013-07-21.RetrievedJuly 16,2011.
  12. ^"IEEE Emanuel R. Piore Award Recipients"(PDF).IEEE. Archived fromthe original(PDF)on 2010-11-24.RetrievedDecember 30,2010.
  13. ^"IEEE W.R.G. Baker Prize Paper Award Recipients"(PDF).IEEE. Archived fromthe original(PDF)on April 25, 2011.RetrievedNovember 28,2010.
  14. ^"Elected AAAI Fellows".AAAI.Retrieved2023-12-31.
  15. ^"The President's National Medal of Science: Recipient Details Allen Newell".US National Science Foundation.RetrievedNovember 28,2010.
  16. ^"Franklin Laureate Database - Louis E. Levy Medal Laureates".Franklin Institute.Archived fromthe originalon June 29, 2011.RetrievedJanuary 22,2011.
  17. ^Crevier, Daniel (1993).AI: the tumultuous history of the search for artificial intelligence.New York: Basic books.ISBN978-0-465-02997-6.
  1. ^Logic theorist is usually considered the first true AI program, although Arthur Samuel's checkers program was released earlier. Christopher Strachey also wrote a checkers program in 1951

Further reading

[edit]
[edit]