Timothy+Hart

was an American computer scientist, in the 60s affiliated with Massachusetts Institute of Technology, and in 1970 co-founder of //Evans, Griffiths and Hart, Inc//, EGH. As MIT graduate Timothy Hart was involved in the initial development of Lisp within the group of John McCarthy. Along with Daniel Edwards, Timothy Hart wrote a memo on Alpha-Beta in December 1961, revised version in 1963. It also contains a Theorem by Michael Levin, the well known formula of the number of leaf nodes that need to be examined in Alpha-Beta. || toc =Quotes=
 * Home * People * Timothy Hart**
 * [[image:TimHart.jpg link="http://www.etsisi.upm.es/museo_virtual/3g/mccarthy"]] ||~ || **Timothy P. Hart**, (September 18, 1939 - January 20, 2014 )
 * Timothy Hart ||~ ||^ ||

Alpha-Beta
Quote by John McCarthy from //Human-Level AI is harder than it seemed in 1955// : include page="Quote McCarthy"

LISP
Quote by John McCarthy in //From LISP 1 to LISP 1.5// : include page="Quote McCarthy on LISP" =See also=
 * History of Alpha-Beta
 * Lisp

=Selected Publications=
 * Daniel Edwards, Timothy Hart (**1961**). //The Alpha-Beta Heuristic//. AIM-030, reprint available from [|DSpace] at MIT. Retrieved on 2006-12-21.
 * John McCarthy, Paul W. Abrahams, Daniel J. Edwards, Timothy P. Hart, Michael I. Levin (**1962**) //LISP 1.5 Programmer's Manual//. The M.I.T. Press, second edition (1985) as [|pdf]
 * Timothy P. Hart (**1963**). //A Proposal for a Geometry Theorem Proving Program//, AIM-056, reprint available from [|DSpace] at MIT
 * Timothy P. Hart (**1963**). //MACRO Definitions for LISP//, AIM-057, reprint available from [|DSpace] at MIT
 * Timothy P. Hart, Michael Levin (**1964**). //LISP Exercises//, AIM-064, reprint available from [|DSpace] at MIT
 * [|Robert A. Yates], [|Bertram Raphael], Timothy P. Hart (**1970**). //Resolution Graphs//. [|Artificial Intelligence] Vol. 1, No. 4, [|pdf]

=References= =What links here?= include page="Timothy Hart" component="backlinks" limit="20"
 * Up one level**