TL;DR本文旨在探讨计算机科学中的计算复杂性问题,提出了智能科学的思路和方法,运用试错和动态搜索的框架将 NP 完备问题 Number Partition Problem 作为案例进行讨论。
Abstract
computational complexity is a core theory of computer science, which dictates
the degree of difficulty of computation. There are many problems with high
complexity that we have to deal, which is especially true for AI. This raises a
big question: Is there a better way to deal with thes