Zusammenfassung der Ressource
Julia Robinson
- Basic Info
- b. 1919, St. Louis, MO; d.
1985.
- American mathematician
- Known for Computability
Theory, Computational
Complexity Theory, decision
problems, & solving Hilbert’s
10th problem
- Youth & Studies
- 1936: entered San Diego State
University
- 1939: transferred to University
of California Berkeley
- 1940: received BA degree from
Berkeley
- 1948: got her Ph.D. under Dr.
Alfred Tarski
- Teacher & Researcher
- 1948: dissertation on Definability and
decision problems under Dr. Alfred Tarski
- 1941-1973: statistics lab assistant to Jerzy
Neyman
- 1976: offered a full-time professorship
position at Berkeley
- 1982: nominated for the presidency of the
American mathematical society
- Mathematical Work
- proved that the arithmetic of
rational numbers is undecidable
- 1950: published a paper on general
recursive functions
- 1955: published a paper on
primitive recursive functions
- 1959: published a paper on the
undecidability of algebraic rings
and fields
- 1962: published a paper on
decision problems for algebraic
rings
- Later Years
- 1978: elected to be the
American Association for the
Advancement of Science
- 1980: second woman to give the
Colloquium Lectures (the first
being in 1927)
- 1982: first woman president of the
American Mathematical Society
- Became involved with politics