# Michael J. Beeson

Ph.D. Stanford University 1972

**Michael J. Beeson** (born August 19, 1945 in Topeka, Kansas) is an American mathematician, and Professor of Mathematics and Computer Science, San Jose State University.

## Quotes

edit### "The Mechanization of Mathematics," 2004

editMichael J. Beeson, "The Mechanization of Mathematics," in *Alan Turing: Life and Legacy of a Great Thinker* (2004) p. 1-54

**Alan Turing was the first to make a careful analysis of the potential capabilities of machines, inventing his famous "Turing machines" for the purpose.**He argued that if any machine could perform a computation, then some Turing machine could perform it. The argument focuses on the assertion that any machine's operations could be simulated, one step at a time, by certain simple operations, and that Turing machines were capable of those simple operations. Turing's first fame resulted from applying this analysis to a problem posed earlier by Hilbert, which concerned the possibility of mechanizing mathematics. Turing showed that in a certain sense, it is impossible to mechanize mathematics: We shall never be able to build an "oracle" machine that can correctly answer all mathematical questions presented to it with a "yes" or "no" answer. In another famous paper Turing went on to consider the somewhat different question, "Can machines think?." It is a different question, because perhaps machines can think, but they might not be any better at mathematics than humans are; or perhaps they might be better at mathematics than humans are, but not by thinking, just by brute-force calculation power. These two papers of Turing lie near the roots of the subjects today known as*automated deduction*and*artificial intelligence*.- p. 1

- Gottfried Leibniz is famous... for his slogan
*Calculemus*, which means "Let us calculate." He envisioned a formal language to reduce reasoning to calculation, and he said that reasonable men, faced with a difficult question of philosophy or policy, would express the question in a precise language and use rules of calculation to carry out precise reasoning. This is the first reduction of reasoning to calculation ever envisioned. ...he actually designed and built a working calculating machine, the*Stepped Reckoner*...inspired by the somewhat earlier work of Pascal, who built a machine that could add and subtract. Leibniz's machine could add, subtract, divide, and multiply, and was apparently the first machine with all four arithmetic capabilities.- p. 5

- George Boole took up Leibniz's idea, and wrote a book he called
*The Laws of Thought*. The laws he formulated are now called Boolean algebra... Boole seems to have had a grandiose vision about the applicability of his algebraic methods to practical problems—his book makes it clear that he hoped these laws would be used to settle practical questions. William Stanley Jevons heard of Boole's work, and undertook to build a machine to make calculations in Boolean algebra. He successfully designed and built... the*Logical Piano*... the first machine to do mechanical inference.- p. 5-6

- Gottlob Frege created modern logic including "for all," "there exists," and rules of proof. Leibniz and Boole had dealt only with what we now call "propositional logic" (that is, no "for all" or "there exists"). They also did not concern themselves with rules of proof, since their aim was to reach truth by pure calculation with symbols for the propositions.
**Frege took the opposite track: instead of trying to reduce logic to calculation, he tried to reduce mathematics to logic, including the concept of number.**- p. 6

- Bertrand Russell found Frege's famous error: Frege had overlooked what is now known as the Russell paradox. Namely, Frege's rules allowed one to define the class of x such that P(x) is true for any "concept" P. Frege's idea was that such a class was an object itself, the class of objects "falling under the concept P." Russel used this principle to define the class R of concepts that do not fall under themselves. This concept leads to a contradiction... argument: (1) if R falls under itself then it does not fall under itself; (2) this contradiction shows that it
*does not*fall under itself; (3) therefore by definition it does fall under itself after all.- p. 6