Julia Robinson

Julia Robinson (1919–1985) was an American mathematician whose work on Diophantine equations helped establish that Hilbert’s tenth problem is undecidable.

Hilbert's tenth problem: David Hilbert’s problem asks whether an algorithm can decide if any polynomial equation with integer coefficients has an integer solution. Robinson devoted decades to showing that no such decision algorithm can exist.
Matiyasevich's theorem: The theorem that every computably enumerable set is Diophantine, completing the proof of Hilbert’s tenth problem’s undecidability. Robinson’s work supplied crucial groundwork later completed by Yuri Matiyasevich.
Yuri Matiyasevich: A Soviet mathematician who completed the proof that Hilbert’s tenth problem is undecidable. His theorem completed the program Robinson had helped develop.
Undecidable problem: A decision problem for which no algorithm gives the correct answer on every possible input. Hilbert’s tenth problem became a prominent example of a mathematically natural undecidable question.
Diophantine equation: A polynomial equation whose solutions are sought among integers or other specified number systems. Hilbert’s tenth problem asks for a uniform method to test integer solutions.
Davis–Putnam–Robinson theorem: The theorem that every computably enumerable set can be represented by an exponential Diophantine equation. Robinson co-authored the result that reduced the problem to eliminating exponentials.
Martin Davis: An American mathematician whose work on computability and Diophantine equations contributed to the undecidability proof. Davis collaborated with Robinson and Hilary Putnam on the theorem preceding Matiyasevich’s result.
National Medal of Science: A United States honor recognizing significant contributions to science and engineering. Robinson received the medal in 1983 for her mathematical achievements.
Computability theory: The study of which problems can be solved by algorithms and what resources computation requires. Undecidability places Hilbert’s question among problems no algorithm can solve.
Exponential Diophantine equation: An equation involving integer variables, polynomial operations, and variables raised to variable powers. Robinson studied whether exponential growth could be encoded using ordinary Diophantine equations.

Linked from 3 pages