Turing degree

In computer science and mathematical logic the Turing degree (named after Alan Turing) or degree of unsolvability of a set of natural numbers measures the level of algorithmic unsolvability of the set.


© MMXXIII Rich X Search. We shall prevail. All rights reserved. Rich X Search