The Undecidable: Basic Papers on Undecidable Propositions Unsolvable Problems and Computable Functions - "" (ISBN: 9780486432281)
The Undecidable: Basic Papers on Undecidable Propositions Unsolvable Problems and Computable Functions - "" (ISBN: 9780486432281)
Caracteristici, descrierea produsului - The Undecidable: Basic Papers on Undecidable Propositions Unsolvable Problems and Computable Functions - "" (ISBN: 9780486432281)
Descrierea produsului
| Genul | Limbi străine, Matematică |
Ați găsit greşeli în descrierea produsului? Vă rugăm să ne trimiteți o notificare!
A valuable collection both for original source material as well as historical formulations of current problems. -- The Review of Metaphysics
Much more than a mere collection of papers. A valuable addition to the literature. -- Mathematics of Computation
An anthology of fundamental papers on undecidability and unsolvability by major figures in the field, this classic reference is ideally suited as a text for graduate and undergraduate courses in logic, philosophy, and foundations of mathematics. It is also appropriate for self-study.
The text 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. Additional papers by Church, Turing, and Post cover9783659415555
Much more than a mere collection of papers. A valuable addition to the literature. -- Mathematics of Computation
An anthology of fundamental papers on undecidability and unsolvability by major figures in the field, this classic reference is ideally suited as a text for graduate and undergraduate courses in logic, philosophy, and foundations of mathematics. It is also appropriate for self-study.
The text 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. Additional papers by Church, Turing, and Post cover9783659415555
Prețurile și informațiile de pe paginile noastre sunt furnizate de magazinele partenere și au caracter informativ, unele erori pot apărea. Imaginile produselor au caracter informativ, uneori pot include niște accesorii care nu sunt mereu incluse în pachetul de baza. Informațiile aferente produsului (imagine, descriere, preț) se pot schimba fără notificare prealabilă. Compari.ro nu își asumă responsabilitate pentru eventualele greșeli.
