更改

However, some computational problems are easier to analyze in terms of more unusual resources. For example, a non-deterministic Turing machine is a computational model that is allowed to branch out to check many different possibilities at once. The non-deterministic Turing machine has very little to do with how we physically want to compute algorithms, but its branching exactly captures many of the mathematical models we want to analyze, so that non-deterministic time is a very important resource in analyzing computational problems.

However, some computational problems are easier to analyze in terms of more unusual resources. For example, a non-deterministic Turing machine is a computational model that is allowed to branch out to check many different possibilities at once. The non-deterministic Turing machine has very little to do with how we physically want to compute algorithms, but its branching exactly captures many of the mathematical models we want to analyze, so that non-deterministic time is a very important resource in analyzing computational problems.

然而，一些计算问题更容易用更多不寻常的资源来分析。例如，'''<font color="#ff8000">非确定型图灵机 </font>'''是一个允许同时检查许多不同可能性的计算模型。'''<font color="#ff8000">非确定型图灵机 </font>'''对我们物理上想要的计算算法没有什么影响，但是它的分支精确地捕获了我们想要分析的许多数学模型，因此非确定性时间是分析计算问题的一个非常重要的资源。

然而，一些计算问题更容易用更多不寻常的资源来分析。例如，'''<font color="#ff8000">非确定型图灵机 </font>'''是一个允许同时检查许多不同可能性的计算模型。'''<font color="#ff8000">非确定型图灵机 </font>'''对我们物理上想要的计算算法没有什么影响，但是它的分支精确地捕获了我们想要分析的许多数学模型，因此'''<font color="#ff8000">非确定性时间 </font>'''是分析计算问题的一个非常重要的资源。

===Complexity measures复杂性度量===

===Complexity measures复杂性度量===