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.
Related Free eBooks
Sorry, no samplers or free related ebooks found
Link to this page
Log in with Facebook or Google to save your favorite definitions and share them with friends.