有兴趣google一下,这个理论是什么?
有一篇这样的文章
http://blog.linux.org.tw/~jserv/archives/001758.html
文中提到这个链接 http://arxiv.org/abs/math/0411091v1
发现一篇文章
(Irreducible Complexity in Pure Mathematics)
开头是下面的文字:
====================================================================
Abstract
By using ideas on complexity and randomness originally suggested
by the mathematician-philosopher Gottfried Leibniz in 1686, the mod-
ern theory of algorithmic information is able to show that there can
never be a "theory of everything" for all of mathematics.
====================================================================
汗,不知道怎么说这个了...后会有期!