Julia Robinson

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

Resource summary

	Created by Joseph Gianotti almost 4 years ago