Michael Levin
Michael Levin,
an American computer scientist, in the 60s affiliated with Massachusetts Institute of Technology, and involved in the initial development of Lisp within the group of John McCarthy. The 1961 memo on Alpha-Beta by Daniel Edwards and Timothy Hart [1], contains a Theorem by Michael Levin, the well known formula of the number of leaf nodes that need to be examined in Alpha-Beta.
Quotes
Alpha-Beta
Quote by John McCarthy from Human-Level AI is harder than it seemed in 1955 on the Dartmouth workshop:
Chess programs catch some of the human chess playing abilities but rely on the limited [effective branching](Branching_Factor "Branching Factor") of the chess move [tree](Search_Tree "Search Tree"). The ideas that work for chess are inadequate for [go](Go "Go"). [Alpha-beta pruning](Alpha-Beta "Alpha-Beta") characterizes human play, but it wasn't noticed by [early chess programmers](Category:Pioneer "Category:Pioneer") - [Turing](Alan_Turing "Alan Turing"), [Shannon](Claude_Shannon "Claude Shannon"), [Pasta](John_Pasta "John Pasta") and [Ulam](Stanislaw_Ulam "Stanislaw Ulam"), and [Bernstein](Alex_Bernstein "Alex Bernstein"). We humans are not very good at identifying the heuristics we ourselves use. Approximations to alpha-beta used by [Samuel](Arthur_Samuel "Arthur Samuel"), [Newell](Allen_Newell "Allen Newell") and [Simon](Herbert_Simon "Herbert Simon"), McCarthy. Proved equivalent to [minimax](Minimax "Minimax") by [Hart](Timothy_Hart "Timothy Hart") and Levin, independently by [Brudno](Alexander_Brudno "Alexander Brudno"). [Knuth](Donald_Knuth "Donald Knuth") gives details.
LISP
Quote by John McCarthy in History of Lisp [2]:
Many people participated in the initial development of [LISP](index.php?title=LISP&action=edit&redlink=1 "LISP (page does not exist)"), and I haven't been able to remember all their contributions and must settle, at this writing, for a list of names. I can remember [Paul W. Abrahams](Paul_W._Abrahams "Paul W. Abrahams"), [Robert Brayton](Mathematician#RKBrayton "Mathematician"), [Daniel Edwards](Daniel_Edwards "Daniel Edwards"), [Patrick Fischer](Mathematician#PCFischer "Mathematician"), [Phyllis Fox](Mathematician#PFox "Mathematician"), [Saul Goldberg](http://www.ee.calpoly.edu/faculty/sgoldber/), [Timothy Hart](Timothy_Hart "Timothy Hart"), [Louis Hodes](Mathematician#LHodes "Mathematician"), Michael Levin, [David Luckham](Mathematician#DLuckham "Mathematician"), Klim Maling, [Marvin Minsky](Marvin_Minsky "Marvin Minsky"), [David Park](Mathematician#DPark "Mathematician"), [Nathaniel Rochester](Nathaniel_Rochester "Nathaniel Rochester") of [IBM](index.php?title=IBM&action=edit&redlink=1 "IBM (page does not exist)"), and [Steve Russell](https://en.wikipedia.org/wiki/Steve_Russell_(computer_scientist)).
See also
Selected Publications
- John McCarthy, Paul W. Abrahams, Daniel Edwards, Timothy Hart, Michael Levin (1962). LISP 1.5 Programmer’s Manual. The M.I.T. Press, second edition (1985) available as pdf reprint [3]
- Michael Levin (1963). Primitive Recursion, AIM-055, reprint available from DSpace at MIT
- Timothy Hart, Michael Levin (1964). LISP Exercises, AIM-064, reprint available from DSpace at MIT
- Michael Levin (1964). Syntax of the New Language, AIM-068, reprint available from DSpace at MIT
- Michael Levin (1964). New Language Storage Conventions, AIM-069, reprint available from DSpace at MIT
References
- ↑ Daniel Edwards, Timothy Hart (1961). The Alpha-Beta Heuristic, AIM-030, reprint available from DSpace at MIT
- ↑ John McCarthy (1979). History of Lisp. Chapter 4, From LISP 1 to LISP 1.5
- ↑ McCarthy et al. LISP 1.5 Programmer’s Manual. from The Computer History Museum Software Preservation Group