适合人群:Academics, Students of Philosophy, Logic, and Mathematics, Computer Scientists, Historians of Science, and anyone interested in the foundations of knowledge and computation
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.
ISBN:9780486432281
出版日期:2004-2 适合人群:Academics, Students of Philosophy, Logic, and Mathematics, Computer Scientists, Historians of Science, and anyone interested in the foundations of knowledge and computation