Dan Edward Willard | |
Birth Date: | September 19, 1948 |
Birth Place: | New York City, New York, U.S. |
Death Date: | January 23, 2023 |
Death Place: | Albany, New York, U.S. |
Field: | Computer Science |
Work Institution: | SUNY Albany |
Alma Mater: | Harvard University (PhD) |
Doctoral Advisor: | Gerald Sacks |
Thesis Title: | Predicate-oriented database search algorithms |
Thesis Year: | 1979 |
Dan Edward Willard (September 19, 1948[1] – January 21, 2023) was an American computer scientist and logician, and a professor of computer science at the University at Albany.
Willard did his undergraduate studies in mathematics at Stony Brook University, graduating in 1970. He went on to graduate studies in mathematics at Harvard University, earning a master's degree in 1972 and a doctorate in 1978. After leaving Harvard, he worked at Bell Labs for four years before joining the Albany faculty in 1983.[2]
Although trained as a mathematician and employed as a computer scientist, Willard's most highly cited publication is in evolutionary biology. In 1973, with biologist Robert Trivers, Willard published the Trivers–Willard hypothesis, that female mammals could control the sex ratio of their offspring, and that it would be evolutionally advantageous for healthier or higher-status females to have more male offspring and for less healthy or lower-status females to have more female offspring.[3] Controversial at the time, especially because it proposed no mechanism for this control, this theory was later validated through observation,[4] and it has been called "one ofthe most influential and highly cited papers of 20th century evolutionary biology".[5]
Willard's 1978 thesis work on range searching data structures[6] was one of the predecessors to the technique of fractional cascading,[7] and throughout the 1980s Willard continued to work on related data structure problems. As well as continuing to work on range searching, he did important early work on the order-maintenance problem,[8] and invented the x-fast trie and y-fast trie, data structures for storing and searching sets of small integers with low memory requirements.[9]
In computer science, Willard is best known for his work with Michael Fredman in the early 1990s on integer sorting and related data structures. Before their research, it had long been known that comparison sorting required time
\Theta(nlogn)
n
1
N
O(n(1+\tfrac{logN}{logn}))
N
N
O(n\tfrac{logn}{loglogn})
After 2000, Willard's publications primarily concerned self-verifying theories: systems of logic that have been weakened sufficiently, compared to more commonly studied systems, to prevent Gödel's incompleteness theorems from applying to them. Within these systems, it is possible to prove that the systems themselves are logically consistent, without this deduction leading to the self-contradiction that Gödel's theorem implies for stronger systems.[13] In a preprint summarizing his oeuvre of work in this area, Willard speculated that these logical systems will be of importance in developing artificial intelligences that can survive the potential extinction of mankind, reason consistently, and recognize their own consistency.