非确定性算法_确定性和非确定性算法

非确定性算法

不确定的问题 (Undecidable Problems)

An undecidable problem is a problem for which there is no algorithm that can solve it. Alan Turing proved that the famous halting problem is undecidable. The halting problem can be simply stated as follows - Given an input and a Turing machine, there is no algorithm to determine if the machine will eventually halt. There are several problems in mathematics and computer science that are undecidable.

无法确定的问题是没有算法可以解决的问题。 艾伦·图灵(Alan Turing)证明了著名的停止问题尚不确定。 停止问题可以简单地描述如下-给定输入和Turing机器，没有算法确定机器是否最终停止。 在数学和计算机科学中存在一些无法确定的问题。

多项式和非多项式时间算法 (Polynomial and Non - polynomial time algorithm)

If the complexity of an algorithm is expressed as O (p(n)) where p(n) is some polynomial of n, then the algorithm is said to be a polynomial time algorithm. Generally, polynomial time algorithms are tractable. Any algorithm with a time complexity that cannot be bounded by such bound then this is known as non - polynomial algorithms.

如果一种算法的复杂度被表示为O(P(N))其中p(n)是