Julia Robinson
Julia Hall Bowman Robinson (December 8, 1919 – July 30, 1985) was an American mathematician noted for her contributions to the fields of computability theory and computational complexity theory—most notably in decision problems. Her work on Hilbert's tenth problem (now known as Matiyasevich's theorem or the MRDP theorem) played a crucial role in its ultimate resolution. Robinson was a 1983 MacArthur Fellow.
Julia Hall Bowman Robinson | |
|---|---|
Julia Robinson in 1975 | |
| Born | Julia Hall Bowman December 8, 1919 |
| Died | July 30, 1985 (aged 65) Oakland, California, United States |
| Nationality | American |
| Citizenship | United States |
| Alma mater | University of California, Berkeley |
| Known for | Diophantine equations Decidability MRDP theorem Robinson's proof |
| Spouse | Raphael M. Robinson |
| Awards | Noether Lecture (1982) MacArthur Fellow |
| Scientific career | |
| Fields | Mathematician |
| Institutions | University of California, Berkeley |
| Doctoral advisor | Alfred Tarski |
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.