Julia Robinson
Julia Robinson | |
|---|---|
Robinson in 1975 | |
| Born | Julia Hall Bowman December 8, 1919 St. Louis, Missouri, United States |
| Died | July 30, 1985 (aged 65) Oakland, California, United States |
| Education | 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 |
| Workplaces | University of California, Berkeley |
| Alfred Tarski | |
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 professor at UC Berkeley, the first female mathematician to be elected to the National Academy of Sciences, and a 1983 MacArthur Fellow.