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:
“It is a monstrous thing to force a child to learn Latin or Greek or mathematics on the ground that they are an indispensable gymnastic for the mental powers. It would be monstrous even if it were true.”
—George Bernard Shaw (1856–1950)
“The analogy between the mind and a computer fails for many reasons. The brain is constructed by principles that assure diversity and degeneracy. Unlike a computer, it has no replicative memory. It is historical and value driven. It forms categories by internal criteria and by constraints acting at many scales, not by means of a syntactically constructed program. The world with which the brain interacts is not unequivocally made up of classical categories.”
—Gerald M. Edelman (b. 1928)
“We would be a lot safer if the Government would take its money out of science and put it into astrology and the reading of palms.... Only in superstition is there hope. If you want to become a friend of civilization, then become an enemy of the truth and a fanatic for harmless balderdash.”
—Kurt Vonnegut, Jr. (b. 1922)