更改

Informally, a set of natural numbers A is Turing reducible to a set B if there is an oracle machine that correctly tells whether numbers are in A when run with B as the oracle set (in this case, the set A is also said to be (relatively) computable from B and recursive in B).  If a set A is Turing reducible to a set B and B is Turing reducible to A then the sets are said to have the same Turing degree (also called degree of unsolvability).  The Turing degree of a set gives a precise measure of how uncomputable the set is.

Informally, a set of natural numbers A is Turing reducible to a set B if there is an oracle machine that correctly tells whether numbers are in A when run with B as the oracle set (in this case, the set A is also said to be (relatively) computable from B and recursive in B).  If a set A is Turing reducible to a set B and B is Turing reducible to A then the sets are said to have the same Turing degree (also called degree of unsolvability).  The Turing degree of a set gives a precise measure of how uncomputable the set is.

非正式地，一组自然数 a 是图灵可约化为一组 b，如果有一台 oracle 机器正确地告诉数字是否在 a 中，当 b 作为 oracle 集运行时(在这种情况下，集合 a 也被称为(相对地)可由 b 计算，在 b 中是递归的)。如果一个集合 a 是图灵可约的集合 b，而 b 是图灵可约的集合 a，那么这两个集合被称为具有相同的图灵度(也称为不可解度)。一个集合的图灵度可以精确地度量该集合的不可计算性。

非正式地，一组自然数 a 是'''<font color="#ff8000">图灵可约 Turing reducible</font>'''地化为一组 b，如果有一台预言机正确地告诉数字是否在 a 中，当 b 作为预言集运行时(在这种情况下，集合 a 也被称为(相对地)可由 b 计算，在 b 中是递归的)。如果一个集合 a 是图灵可约的集合 b，而 b 是图灵可约的集合 a，那么这两个集合被称为具有相同的'''<font color="#ff8000">图灵度 Turing degree</font>'''(也称为不可解度)。一个集合的图灵度可以精确地度量该集合的不可计算性。

The natural examples of sets that are not computable, including many different sets that encode variants of the halting problem, have two properties in common:

The natural examples of sets that are not computable, including many different sets that encode variants of the halting problem, have two properties in common:

不可计算的集合的自然例子，包括许多不同的编码停机问题变体的集合，有两个共同的属性:

不可计算的集合的自然例子，包括许多不同的编码'''<font color="#ff8000">停机问题 halting problem</font>'''变体的集合，有两个共同的属性:

#They are [[recursively enumerable]], and

#They are [[recursively enumerable]], and