ALGORITHMIC COMPLEXITY AND PRACTICAL PROBLEMS

由Gregory Chaitin开发的算法复杂性， 表明存在理论上的限制 计算机的计算能力。它的成就之一是 是哥德尔著名定理的算法形式 形式系统的不完全性。然而，在柴田 理论上，资源是没有限制的。 为了使分析更切合实际 在资源有限的情况下，我们有 修改了Chaitin对算法信息的定义 纳入对资源的限制。通过这一修改 我们能够证明哥德尔定理的一种修正形式 建立计算复杂性的某些界限。在……里面 具体地说，我们可以证明某些 棘手的决策问题。这方面的研究正在进行中 区域。

Algorithmic complexity, as developed by Gregory Chaitin, shows that there are theoretical limits on the computational ability of computers. One of its achievements is an algorithmic form of Godel's famous theorem on the incompleteness of formal systems. However, in the Chaitin theory there is no limitation put on resources. In an attempt to make an analysis of more practical problems where there are limitations on resources, we have modified the Chaitin definition of algorithmic information to incorporate a limit on resources. With this modification we are able to prove a modified form of Godel's theorem and establish certain bounds on computational complexity. In particular we can demonstrate the existence of certain intractable decision problems. Research is ongoing in this area.