The Halting Probability Omega: Irreducible Complexity in Pure Mathematics
英文摘要：
Some Goedel centenary reflections on whether incompleteness is really serious, and whether mathematics should be done somewhat differently, based on using algorithmic complexity measured in bits of information. [Enriques lecture given Monday, October 30, 2006, at the University of Milan.]
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
