Patrick C. Fischer

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Patrick Carl Fischer (December 3, 1935 – August 26, 2011) was an American computer scientist, a noted researcher in computational complexity theory and database theory, and a target of the Unabomber.[1][2][3][4][5]

Biography[edit]

Fischer was born December 3, 1935, in St. Louis, Missouri.[2][3] His father, Carl H. Fischer, became a professor of actuarial mathematics at the University of Michigan in 1941,[6] and the family moved to Ann Arbor, Michigan where he grew up.[2] Fischer himself went to the University of Michigan, receiving a bachelor's degree in 1957[2][3] and an MBA in 1958.[7] He went on to graduate studies at the Massachusetts Institute of Technology, earning a Ph.D. in 1962 under the supervision of Hartley Rogers, Jr., with a thesis on the subject of recursion theory.[2][3][8]

After receiving his Ph.D. in 1962, Fischer joined the faculty of Harvard University as an assistant professor of applied mathematics; his students at Harvard included Albert R. Meyer, through whom Fischer has over 250 academic descendants. as well as noted computer scientists Dennis Ritchie and Arnold L. Rosenberg.[8] In 1965, he moved to a tenured position as associate professor of computer science at Cornell University, and again in 1968 he moved to the University of Waterloo where he became a professor of applied analysis and computer science. At Waterloo, he was department chair from 1972 to 1974. He then moved to Pennsylvania State University in 1974, where he headed the computer science department, and moved again to Vanderbilt University as department chair in 1980.[1][2][3] He taught at Vanderbilt for 18 years, and was chair for 15 years.[5] He retired in 1998,[2] and died of stomach cancer on August 26, 2011 in Rockville, Maryland.[1][2][3]

Like his father, Fischer became a fellow of the Society of Actuaries.[9] Fischer's second wife, Charlotte Froese Fischer, is also a computer science professor at Vanderbilt University, and his brother, Michael J. Fischer, is a computer science professor at Yale University.[3][1]

Research[edit]

Fischer's thesis research concerned the effects of different models of computation on the efficiency of solving problems. For instance, he showed how to generate the sequence of prime numbers using a one-dimensional cellular automaton, based on earlier solutions to the firing squad synchronization problem,[10] and his work in this area set the foundation for much later work on parallel algorithms.[1] WIth Meyer and Rosenberg, Fischer performed influential early research on counter machines, showing that they obeyed time hierarchy and space hierarchy theorems analogous to those for Turing machines.[11]

Fischer was an early leader in the field of computational complexity, and helped establish theoretical computer science as a discipline separate from mathematics and electrical engineering.[4] He was the first chair of SIGACT, the Special Interest Group on Algorithms and Computation Theory of the Association for Computing Machinery, which he founded in 1968.[1][2] He also founded the annual Symposium on Theory of Computing, which together with the Symposium on Foundations of Computer Science is one of the two flagship conferences in theoretical computer science, and he served five times as chair of the conference.[1]

In the 1980s, Fischer's research interests shifted to database theory. His research in that area included the study of the semantics of databases, metadata, and incomplete information.[1] Fischer did important work defining the nested relational model of databases, in which the values in the cells of a relational database may themselves be relations,[12][13] and his work on the mathematical foundations of database query languages became central to the databases now used by major web servers worldwide.[2]

Fischer was also an expert in information systems and their use by educational institutions.[3][5]

Unabomber[edit]

Ted Kaczynski, known as the Unabomber, was a graduate student of mathematics at the University of Michigan, where Fischer's father was a professor.[3] In 1982, Kaczynski sent the fifth of his mail bombs to Fischer, at his Penn State address; it was forwarded to Vanderbilt, where it was opened on May 5 by Fischer's secretary, Janet Smith, who was hospitalized for three weeks after the attack.[3][2] Fischer claimed not to have ever met Kaczynski,[1][2] and speculated that he was targeted because he had moved from pure mathematics to more applied research areas.[2]

Kaczynski was not apprehended until 1996, by which time the statute of limitations on the 1982 bombing had expired, so he was never prosecuted for it.[1]

References[edit]

  1. ^ a b c d e f g h i j Fortnow, Lance (August 29, 2011), Patrick Fischer (1935-2011) .
  2. ^ a b c d e f g h i j k l m Vitello, Paul (August 31, 2011), "Patrick C. Fischer, Early Unabomber Target, Is Dead at 75", New York Times .
  3. ^ a b c d e f g h i j "Patrick Fischer, 1935–2011: Professor was targeted by the Unabomber", Los Angeles Times, September 3, 2011 .
  4. ^ a b Patrick Fischer, Former Professor and Department Head of Computer Science at Penn State, Dies, Pennsylvania State University Department of Computer Science and Engineering, retrieved 2011-09-03 .
  5. ^ a b c "Patrick Fischer, former computer science chair, dies", Vanderbilt News, August 26, 2011 .
  6. ^ "Carl H. Fischer", University of Michigan Faculty History Project, retrieved 2011-09-03 .
  7. ^ Dividend, the Magazine of the Graduate School of Business Administration (University of Michigan), Fall 1981: 43 http://deepblue.lib.umich.edu/bitstream/2027.42/50729/2/1981-fall-dividend-text.pdf |url= missing title (help) .
  8. ^ a b Patrick Carl Fischer at the Mathematics Genealogy Project
  9. ^ American Academy of Actuaries (1969), 1969 Year Book, University of Chicago, p. 33 .
  10. ^ Fischer, Patrick C. (1965), "Generation of primes by a one-dimensional real-time iterative array", Journal of the ACM 12 (3): 388–394, doi:10.1145/321281.321290 .
  11. ^ Fischer, Patrick C.; Meyer, A. R.; Rosenberg, Arnold L. (1968), "Counter machines and counter languages", Mathematical Systems Theory 2: 265–283, doi:10.1007/bf01694011, MR 0235932 .
  12. ^ Thomas, Stan J.; Fischer, Patrick C. (1986), "Nested Relational Structures", Advances in Computing Research 3: 269–307 .
  13. ^ Fischer, Patrick C.; Thomas, Stan J. (1983), "Operators for Non-First-Normal-Form Relations", Proceedings of the 7th International Computer Software Applications Conference (IEEE COMPSAC '83), pp. 464–475 .