Daniel Edwards

Home * People * Daniel Edwards

Daniel J. Edwards,
an American computer scientist with a long-term career as a computer security researcher at the National Security Agency (NSA) ¹. In 1972 he coined the term Trojan horse for malicious computer programs ². In the 60s, while affiliated with Massachusetts Institute of Technology, he was involved in the initial development of LISP within the group of John McCarthy. Along with Timothy Hart, Daniel Edwards 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.

Contents

Quotes

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 of the chess move tree. The ideas that work for chess are inadequate for go. Alpha-beta pruning characterizes human play, but it wasn't noticed by early chess programmers - Turing, Shannon, Pasta and Ulam, and Bernstein. We humans are not very good at identifying the heuristics we ourselves use. Approximations to alpha-beta used by Samuel, Newell and Simon, McCarthy. Proved equivalent to minimax by Hart and Levin, independently by Brudno. Knuth gives details.

Quote by John McCarthy in History of Lisp ⁴:

Many people participated in the initial development of LISP, 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, Robert Brayton, Daniel Edwards, Patrick Fischer, Phyllis Fox, Saul Goldberg, Timothy Hart, Louis Hodes, Michael Levin, David Luckham, Klim Maling, Marvin Minsky, David Park, Nathaniel Rochester of IBM, and Steve Russell.