nonamestreet对《Quantum Computing since Democritus》的笔记(2)

Quantum Computing since Democritus
  • 书名: Quantum Computing since Democritus
  • 作者: Scott Aaronson
  • 页数: 398
  • 出版社: Cambridge University Press
  • 出版年: 2013-4-29
  • 第23页

    a consistent, computable proof system F that any statements about all integers can be provided or disproved cannot prove the consistency of it self.

    The proof can be derived from the Turing machine halting problem. 视频:

    This is called Godel’s Second Incompleteness Theorem.

    要证明F我们就需要F加上Con(F)也就是证明F成立的Axiom,并且F肯定无法证明Con(F)不然Halting program就能存在了。

    2017-05-05 20:25:15 回应
  • 第15页

    The Banach–Tarski Paradox


    2017-05-05 20:31:55 回应