Automated Mathematician

Automated Mathematician

The Automated Mathematician is one of the earliest successful discovery systems. It was created by Doug Lenat in Lisp, and in 1977 led to Lenat being awarded the IJCAI Computers and Thought Award.

AM worked by generating and modifying short Lisp programs which were then interpreted as defining various mathematical concepts; for example, a program that tested equality between the length of two lists was considered to represent the concept of numerical equality, while a program that produced a list whose length was the product of the lengths of two other lists was interpreted as representing the concept of multiplication. The system had elaborate heuristics for choosing which programs to extend and modify, based on the experiences of working mathematicians in solving mathematical problems.

Controversy

Lenat claimed that the system was composed of hundreds of data structures called "concepts," together with hundreds of "heuristic rules" and a simple flow of control: "AM repeatedly selects the top task from the agenda and tries to carry it out. This is the whole control structure!" Yet the heuristic rules were not always represented as separate data structures; some had to be intertwined with the control flow logic. Some rules had preconditions that depended on the past history, or otherwise could not be represented in the framework of the explicit rules.

What's more, the published versions of the rules often involve vague terms that are not defined further, such as "If two expressions are structurally similar, ..." (Rule 218) or "... replace the value obtained by some other (very similar) value..." (Rule 129).

Another source of information is the user, via Rule 2: "If the user has recently referred to X, then boost the priority of any tasks involving X." Thus, it appears quite possible that much of the real discovery work is buried in unexplained procedures.

Lenat claimed that the system had rediscovered both Goldbach's conjecture and the Unique Prime Factorization Theorem. Later critics accused Lenat of over-interpreting the output of AM. In his paper "Why AM and Eurisko appear to work", Lenat conceded that any system that generated enough short Lisp programs would generate ones that could be interpreted by an external observer as representing equally sophisticated mathematical concepts. However, he argued that this property was in itself interesting—and that a promising direction for further research would be to look for other languages in which short random strings were likely to be useful.

Successor

This intuition was the basis of AM's successor Eurisko, which attempted to generalize the search for mathematical concepts to the search for useful heuristics.

Further reading

* Lenat, D.B., (1976), AM: An artificial intelligence approach to discovery in mathematics as heuristic search, Ph.D. Thesis, AIM-286, STAN-CS-76-570, and Heuristic Programming Project Report HPP-76-8, Stanford University, AI Lab., Stanford, CA. Published in "Knowledge-based systems in artificial intelligence" along with Randall Davis's Ph.D. Thesis, McGraw-Hill, 1982.
* Lenat, D. B., and Brown, J. S. (August 1984). "Why AM and EURISKO appear to work." "Artificial Intelligence" 23(3):269--294.
* Ritchie, G. D., and Hanna, F. K. (August 1984). "AM: A case study in AI methodology" "Artificial Intelligence" 23(3):249--268.

See also

* Douglas Lenat
* Computer-assisted proof
* Automated theorem proving
* Symbolic mathematics
* Experimental mathematics

External links

* Edmund Furse; [http://www.comp.glam.ac.uk/pages/staff/efurse/Abstracts/Why-did-AM-halt.html Why did AM run out of steam?]
* Ken Haase's Ph.D. Thesis; [http://web.media.mit.edu/~haase/thesis/thesis.html Invention and Exploration in Discovery,] a rational reconstruction of Doug Lenat's seminal AM program and an analysis of the relationship between invention and exploration in discovery.


Wikimedia Foundation. 2010.

Игры ⚽ Поможем решить контрольную работу

Look at other dictionaries:

  • Peter Andrews (mathematician) — Peter Andrews may also refer to a pseudonym of Steven Soderbergh.Peter B. Andrews (born 1937) is an American mathematician and Professor of Mathematics at Carnegie Mellon University in Pittsburgh, Pennsylvania. He received his Ph.D. from… …   Wikipedia

  • History of robots — The history of robots date at least as far back as the ancient legends.Robotics in AntiquityLikely fictional, the Iliad illustrates the concept of robotics by stating that the god Hephaestus made talking mechanical handmaidens out of gold. cite… …   Wikipedia

  • List of mathematics articles (A) — NOTOC A A Beautiful Mind A Beautiful Mind (book) A Beautiful Mind (film) A Brief History of Time (film) A Course of Pure Mathematics A curious identity involving binomial coefficients A derivation of the discrete Fourier transform A equivalence A …   Wikipedia

  • Eurisko — (Gr., I discover ) is a program written by Douglas Lenat in the Lisp programming language. A sequel to Automated Mathematician, it consists of heuristics, i.e. rules of thumb, including heuristics describing how to use and change its own… …   Wikipedia

  • Eurisko — (Gr., découvrir) est un programme informatique écrit en Lisp par Douglas Lenat. Eurisko est une évolution du programme Automated Mathematician et consiste en un ensemble d heuristiques, c est à dire des règles empiriques. Certaines de ces… …   Wikipédia en Français

  • George Pólya — (b. December 13, 1887 ndash; d. September 7, 1985, in Hungarian Pólya György ) was a Hungarian mathematician.Life and worksHe was born as Pólya György in Budapest, Hungary, and died in Palo Alto, California, USA. He was a professor of mathematics …   Wikipedia

  • Outline of artificial intelligence — The following outline is provided as an overview of and topical guide to artificial intelligence: Artificial intelligence (AI) – branch of computer science that deals with intelligent behavior, learning, and adaptation in machines. Research in AI …   Wikipedia

  • List of mathematical logic topics — Clicking on related changes shows a list of most recent edits of articles to which this page links. This page links to itself in order that recent changes to this page will also be included in related changes. This is a list of mathematical logic …   Wikipedia

  • AM — AM, Am, or am may refer to: * Master of Arts (postgraduate), ( Artium Magister ) alternative abbreviation for a Master s degree in Arts * Americium, a chemical element with symbol Am * Arthur Merlin protocol, an interactive proof system in… …   Wikipedia

  • Discovery system — A discovery system is an artificial intelligence system which attempts to discover new scientific concepts or laws. Notable discovery systems have included, Autoclass Automated Mathematician DALTON Eurisko Glauber Machine for Questions and… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”