This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.
Simply click on the Download Book button.
Yes, Book downloads on Ebookily are 100% Free.
Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"
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.
Author(s): Piergiorgio Odifreddi
Series: Studies in Logic and the Foundations of Mathematics 125
Publisher: Elsevier
Year: 1999
Language: English
Commentary: bookmarks: 2 levels
Pages: 690