Luke Muehlhauser: InUrban & Vyskocil (2013)和其他文章，您在数学的形式化和自动化定理证明中撰写了有关艺术的文章。在我在这种情况下询问机器学习之前，您能否迅速为我们总结一下我们在此阶段可以做什么，而在自动定理证明时可以做什么？

Josef Urban: The best-known result is the proof of the Robbins conjecture found automatically byBill McCune’s system EQP in 1996。Automated theorem proving (ATP) can be used today for solving some open equational algebraic problems, for example in the准循环理论。这种开放问题的证明可能是数千个推论，与数学家产生的证据完全不同。解决ATP问题通常不是“按钮”的问题。它可能需要特定的问题重新进行（通常仅涉及几个公理），适用于ATP，探索适合ATP搜索参数，有时还指导Lemmas（“提示”）的最终证明尝试，这些尝试可用于解决更简单的相关问题。

ATP is today also used for proving small lemmas in large formal libraries developed with interactive theorem provers (ITPs) such as Mizar, Isabelle and HOL Light. This is called “large-theory” ATP. In the past ten years, we have found that even with the large mathematical libraries (thousands of definitions and theorems) available in these ITPs, it is often possible to automatically select the relevant previous knowledge from such libraries and find proofs of small lemmas automatically without any manual pre-processing. Such proofs are usually much shorter than the long proofs of the equational algebraic problems, but even that already helps a lot to the people who use ITPs to formally prove more advanced theorems.

An illustrative example is theFlyspeck(“Formal Proof of Kepler”) project led by Tom Hales, who proved the Kepler conjecture in 1998. The proof is so involved that the only way how to ensure its correctness is formal verification with an ITP. Tom Hales has recently written a300-page bookabout the proof, with the remarkable property that most of the concepts, lemmas and proofs have a computer-understandable “Flyspeck” counterpart that is stated and verified in HOL Light. Hales estimates that this has taken about 20 man-years. Recently, wehave显示that the proofs of about 47% of the 14000 small Flyspeck lemmas could be found automatically by large-theory ATP methods. This means that the only required mental effort is to formally state these lemmas in HOL Light. Again, the caveat is that the lemmas have to be quite easy to prove from other lemmas that are already in the library. On the other hand, this means that once we have such large corpus of formally-stated everyday mathematics, it is possible to use the corpus together with the large-theory ATP methods to solve many simple formally-stated mathematical problems.

Another interesting recent development are ATP methods that efficiently combine “reasoning” and “computing”. This has been a long-time challenge for ATP systems, particularly when used for software and hardware verification. Recent SMT (Satisfiability Modulo Theories) systems such asZ3integrate a number of decision procedures, typically about linear and nonlinear arithmetics, bitvectors, etc. I am not an expert in this area, but I get the impression that the growing strength of such systems is making the full formal verification of complex hardware and software systems more and more realistic.

Read more »

Luke Muehlhauser: Though you’re best known for your work in theoretical computer science, you’ve also produced some pretty interesting philosophical work, e.g. in量子计算以来, “Why Philosophers Should Care About Computational Complexity,” and “The Ghost in the Quantum Turing Machine。”You also taught a fall 2011 MIT class on哲学和理论计算机科学。

Why are you so interested in philosophy? And what is the social value of philosophy, from your perspective?

斯科特·亚伦森（Scott Aaronson）:我总是本能地次大陆所吸引t, most general questions that it seemed possible to ask. You know, like are we living in a computer simulation? if not, could we upload our consciousnesses into one? are there discrete “pixels” of spacetime? why does it seem impossible to change the past? could there be different laws of physics where 2+2 equaled 5? are there objective facts about morality? what does it mean to be rational? is there an explanation for why I’m alive right now, rather than some other time? Whatareexplanations, anyway? In fact, what really perplexes me is when I meet a smart, inquisitive person—let’s say a mathematician or scientist—who claims NOT to be obsessed with these huge issues! I suspect many MIRI readers might feel drawn to such questions the same way I am, in which case there’s no need to belabor the point.

从我的角度来看，构建问题的最佳方法不是：“为什么对哲学感兴趣？”而是：“为什么对其他任何东西感兴趣？”

But I think the latter question has an excellent answer. A crucial thing humans learned, starting around Galileo’s time, is that even if you’re interested in the biggest questions, usually the only way to make progress on them is to pick off smaller subquestions: ideally, subquestions that you can attack using math, empirical observation, or both. For again and again, you find that the subquestions aren’t nearly as small as they originally looked! Much like with zooming in to the Mandelbrot set, each subquestion has its own twists and tendrils that could occupy you for a lifetime, and each one gives you a new perspective on the big questions. And best of all, you can actuallyanswer的一些subquestions,是第一个人to do so: you can permanently move the needle of human knowledge, even if only by a minuscule amount. As I once put it, progress in math and science — think of natural selection, Godel’s and Turing’s theorems, relativity and quantum mechanics — has repeatedly altered the terms of philosophical discussion, as philosophical discussionitselfhas rarely altered them! (Of course, this is completely leaving aside math and science’s “fringe benefit” of enabling our technological civilization, which is not chickenfeed either.)

Read more »