Richard Statman
Richard Statman (born September 6, 1946) is an American computer scientist whose principal research interest is the theory of computation, especially symbolic computation. His research involves lambda calculus, type theory, and combinatory algebra.
Richard Statman | |
|---|---|
| Born | September 6, 1946 (age 73) |
| Alma mater | Stanford University |
| Scientific career | |
| Fields | computer science |
| Institutions | Carnegie Mellon |
| Doctoral advisor | Georg Kreisel |
Career
In 1974, Statman received his Ph.D. from Stanford University for his Ph.D dissertation, supervised by Georg Kreisel, entitled Structural Complexity of Proofs. His achievements include the proof that type inhabitation problem in simply typed lambda calculus is PSPACE-complete.
gollark: National security reasons.
gollark: I'm hoping that asteroid mining technology becomes practical reasonably soon, both because of the future of the human of the race and all that and to annoy "people" who "invest" "in" "gold".
gollark: Unlike everything about what I'm going to call the MemeEconomy v2 alpha regardless of Noerdy's weird naming schemes!
gollark: German also has the possibly-misfeature of having gigantically long compound words where English has phrases or maybe sometimes hyphenated phrases.
gollark: English is very lacking as a language.
External links
Authority control  |
|
|---|
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.