Fredkin has been broadly interested in computation, hardware as well as software. In the early 1960s, he wrote the first PDP-1assembler at BBN. He is inventor of the trie data structure [1], the Fredkin gate and the Billiard-Ball Computer Model for reversible computing. His primary contributions include his work on reversible computing and cellular automaton. While Konrad Zuse's book, Calculating Space, mentioned the importance of reversible computation, the Fredkin gate represented the essential breakthrough [2]. He has further been involved in computer vision, artificial intelligence research, and computer chess. Ed Fredkin instrumented the original conception and hardware design of the Chess-orientated Processing System CHEOPS, which was used by Baisley'sTech 2 and a brute force version of Greenblatt'sMac Hack at the end of the 70s [3].
In 1980, Carnegie Mellon University has announced the establishment of a $100,000 prize for the first computer program to become World Chess Champion and the beginning of annual computer versus human competition. The prize called Fredkin Prize, has been established by the Fredkin Foundation of Cambridge, Massachusetts [7], to encourage continued research progress in computer chess. The prize was three-tiered [8]:
Seven years later, the intermediate prize of $10,000 for the first chess machine to reach international master status was awarded in 1989 to five Carnegie Mellon graduate students who built Deep Thought, the precursor to Deep Blue, at the university.
The $100,000 third tier of the prize was awarded at AAAI–97 to this IBM team, who built the first computer chess machine that beat a world chess champion.
Belle, developed by Ken Thompson and Joe Condon at Bell Labs, was the first chess program to obtain the United States Chess Federation Master title in 1983. It was awarded the first Fredkin Prize of $5,000 for this achievement.
Deep Blue, a parallel supercomputer that processes an average of 200 million chess positions per second, is the first chess machine to draw and beat a world chess champion in a regulation game, and the first chess machine to beat the world champion in a regulation match.
Quotes
“There has never been any doubt in my mind that a computer would ultimately beat a reigning world chess champion,” said Fredkin. “The question has always been when.”
Edward Fredkin and Tommaso Toffoli (1978). Design principles for achieving high-performance submicron digital technologies. Proposal to DARPA, MIT Laboratory for Computer Science.
an American physicist, computer scientist, pioneer of digital physics and advocate of digital philosophy. He was full professor at Massachusetts Institute of Technology, from 1971 to 1974 Director of Project MAC and more recently a Distinguished Career Professor at Carnegie Mellon University, at Boston University and a Visiting Professor at MIT.
Fredkin has been broadly interested in computation, hardware as well as software. In the early 1960s, he wrote the first PDP-1 assembler at BBN. He is inventor of the trie data structure [1], the Fredkin gate and the Billiard-Ball Computer Model for reversible computing. His primary contributions include his work on reversible computing and cellular automaton. While Konrad Zuse's book, Calculating Space, mentioned the importance of reversible computation, the Fredkin gate represented the essential breakthrough [2]. He has further been involved in computer vision, artificial intelligence research, and computer chess. Ed Fredkin instrumented the original conception and hardware design of the Chess-orientated Processing System CHEOPS, which was used by Baisley's Tech 2 and a brute force version of Greenblatt's Mac Hack at the end of the 70s [3].
Table of Contents
Photos
The Fredkin Prize
In 1980, Carnegie Mellon University has announced the establishment of a $100,000 prize for the first computer program to become World Chess Champion and the beginning of annual computer versus human competition. The prize called Fredkin Prize, has been established by the Fredkin Foundation of Cambridge, Massachusetts [7], to encourage continued research progress in computer chess. The prize was three-tiered [8]:Teams honored at AAAI 97
[9]Quotes
“There has never been any doubt in my mind that a computer would ultimately beat a reigning world chess champion,” said Fredkin. “The question has always been when.”Selected Publications
[11] [12]External Links
References
What links here?
Up one level