The Theory of Functions and Sets of Natural Numbers Volume 125
Tell us what's wrong and we'll take a look.
Thanks – we got it. We'll review and follow up if needed.
Among the subjects covered are: various equivalent approaches to effective computability and their relations with computers and programming languages; a discussion of Church's thesis; a modern solution to Post's problem; global properties of Turing degrees; and a complete algebraic characterization of many-one degrees. Included are a number of applications to logic (in particular Gödel's theorems) and to computer science, for which Recursion Theory provides the theoretical foundation.
Readwise Books is an ebook & audiobook platform that automatically logs how much you and your friends read, making it fun and easy to read more. Learn more →
Enter your email to continue. We'll create your account if you're new here.