Mathematics and Computer Science
Putnam has contributed to scientific fields not directly related to his work in philosophy. As a mathematician, Putnam contributed to the resolution of Hilbert's tenth problem in mathematics. Yuri Matiyasevich had formulated a theorem involving the use of Fibonacci numbers in 1970, which was designed to answer the question of whether there is a general algorithm that can decide whether a given system of Diophantine equations (polynomials with integer coefficients) has a solution among the integers. Putnam, working with Martin Davis and Julia Robinson, demonstrated that Matiyasevich's theorem was sufficient to prove that no such general algorithm can exist. It was therefore shown that David Hilbert's famous tenth problem has no solution.
In computability theory, Putnam investigated the structure of the ramified analytical hierarchy, its connection with the constructible hierarchy and its Turing degrees. He showed that there exist many levels of the constructible hierarchy which do not add any subsets of the integers and later, with his student George Boolos, that the first such "non-index" is the ordinal of ramified analysis (this is the smallest such that is a model of full second-order comprehension), and also, together with a separate paper with Richard Boyd (another of Putnam's students) and Gustav Hensel, how the Davis–Mostowski–Kleene hyperarithmetical hierarchy of arithmetical degrees can be naturally extended up to .
In computer science, Putnam is known for the Davis-Putnam algorithm for the Boolean satisfiability problem (SAT), developed with Martin Davis in 1960. The algorithm finds if there is a set of true or false values that satisfies a given Boolean expression so that the entire expression becomes true. In 1962, they further refined the algorithm with the help of George Logemann and Donald W. Loveland. It became known as the DPLL algorithm. This algorithm is efficient and still forms the basis of most complete SAT solvers.
Read more about this topic: Hilary Putnam
Famous quotes containing the words mathematics, computer and/or science:
“Mathematics alone make us feel the limits of our intelligence. For we can always suppose in the case of an experiment that it is inexplicable because we don’t happen to have all the data. In mathematics we have all the data ... and yet we don’t understand. We always come back to the contemplation of our human wretchedness. What force is in relation to our will, the impenetrable opacity of mathematics is in relation to our intelligence.”
—Simone Weil (1909–1943)
“The Buddha, the Godhead, resides quite as comfortably in the circuits of a digital computer or the gears of a cycle transmission as he does at the top of a mountain or in the petals of a flower.”
—Robert M. Pirsig (b. 1928)
““You are bothered, I suppose, by the idea that you can’t possibly believe in miracles and mysteries, and therefore can’t make a good wife for Hazard. You might just as well make yourself unhappy by doubting whether you would make a good wife to me because you can’t believe the first axiom in Euclid. There is no science which does not begin by requiring you to believe the incredible.””
—Henry Brooks Adams (1838–1918)