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: Only if you have the "axiomatic set theory" checkbox enabled, and who runs them with that?
gollark: "Jamming" a GTech™ all particle information reader™? What a hilarious concept.
gollark: (I checked using a GTech™ all particle information reader™)
gollark: It was identical to the one on your desk.
gollark: We got it directly from your storage.
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.