El directorio enciclopédico desde la Wikipedia.
Julia Hall Bowman Robinson (December 8, 1919 – July 30, 1985) was an American mathematician, born in St. Louis, Missouri. She is best known for her work on decision problems and Hilbert's Tenth Problem.
[edit] Background and educationRobinson was born in St. Louis, Missouri, the daughter of Ralph Bowers Bowman and Helen (Hall) Bowman. [1] Her older sister is the mathematical popularizer and biographer Constance Reid. The family moved to Arizona and then to San Diego when the girls were a few years old. [2] She entered San Diego State University in 1936 and transferred as a senior to University of California, Berkeley in 1939. She received her AB degree in 1940 and continued in graduate studies. [1] She married Berkeley professor Raphael Robinson in 1941. [1] She received the Ph.D. degree in 1948 under Alfred Tarski with a disseration on "Definability and Decision Problems in Arithmetic". [2] Her heart had been damaged by rheumatic fever as a child, and as an adult she suffered poor health and shortness of breath.[2] In 1961 she underwent an operation to remove the scar tissue from her mitral valve. The operation was a success and she became much more active physically and took up bicycling for exercise. [1] In 1975 she became a full professor at Berkeley, teaching quarter-time because she still did not feel strong enough for a full-time job. [1] In 1984 she was diagnosed with leukemia. She underwent treatment and went into remission for a few months, but then the disease recurred and she died in Oakland, California on July 30, 1985. [1] [2] [edit] Work[edit] Hilbert's tenth problemHilbert's tenth problem asks for an algorithm to determine whether a Diophantine equation has any solutions in integers. A series of results developed in the 1940s through 1970 by Robinson, Martin Davis, Hilary Putnam, and Yuri Matiyasevich resolved this problem in the negative; that is, they showed that no such algorithm can exist. George Csicsery produced and directed a one-hour documentary about Robinson titled Julia Robinson and Hilbert's Tenth Problem, that premiered at the Joint Mathematics Meeting in San Diego on January 7, 2008. Notices of the American Mathematical Society printed a film review [3] and an interview with the director. [4] [edit] Other decidability workHer Ph.D. thesis was on "Definability and Decision Problems in Arithmetic". In it she showed that the theory of the rational numbers was undecidable by showing that elementary number theory could be defined in terms of the rationals, and elementary number theory was already known to be undecidable (this is Gödel's first Incompleteness Theorem). [2] [edit] Other mathematical worksRobinson's work only strayed from decision problems twice. [1] The first time was her first paper, published in 1948, on sequential analysis in statistics. The second was a 1951 paper in game theory where she proved that the fictitious play dynamics converges to the mixed strategy Nash equilibrium in two-player zero-sum games. This was posed as a prize problem at RAND with a $200 prize, but she did not receive the prize because she was a RAND employee at the time. [2] [edit] Political workRobinson was attracted to politics by the 1952 presidential campaign of Adlai Stevenson. (Stevenson was her husband's first cousin, but it was his ideas that attracted her and not the family connection.) In the 1950s Robinson was active in local Democratic party activities, and did less mathematics. She stuffed envelopes, rang doorbells, asked for votes, and so on. She was Alan Cranston's campaign manager in Contra Costa County when he ran for his first political office, state controller.[2] [5] [edit] Honors
[edit] Notes
[edit] External links
Directorio de Enlaces Directorio dmoz Directorio espejo dmoz Pedro Bernardo | |||||||||||||||||||||||||||||||||||||||||||
