The Undecidable azw3 chm 地址 kindle 阿里云 下载 umd pdf

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

暂无相关目录，正在全力查找中！

暂无相关内容，正在全力查找中

暂无出版社相关信息，正在全力查找中！

暂无相关书籍摘录，正在全力查找中！

在线阅读地址：The Undecidable在线阅读

在线听书地址：The Undecidable在线收听

在线购买地址：The Undecidable在线购买

暂无原文赏析，正在全力查找中！

书籍介绍

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