High Quality Content by WIKIPEDIA articles! In computer science and mathematical logic the Turing degree or degree of unsolvability of a set of natural numbers measures the level of algorithmic unsolvability of the set. The concept of Turing degree is fundamental in computability theory, where sets of natural numbers are often regarded as decision problems; the Turing degree of a set tells how difficult it is to solve the decision problem associated with the set.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.