product iamge

The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions

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.

Download
Search on Amazon

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"

An anthology of fundamental papers on undecidability and unsolvability, this classic reference opens with G?del's landmark 1931 paper demonstrating that systems of logic cannot admit proofs of all true assertions of arithmetic. Subsequent papers by G?del, Church, Turing, and Post single out the class of recursive functions as computable by finite algorithms. 1965 edition.

Author(s): Martin Davis
Edition: Dover Ed
Year: 2004

Language: English
Pages: 416