logo
Product categories

EbookNice.com

Most ebook files are in PDF format, so you can easily read them using various software such as Foxit Reader or directly on the Google Chrome browser.
Some ebook files are released by publishers in other formats such as .awz, .mobi, .epub, .fb2, etc. You may need to install specific software to read these formats on mobile/PC, such as Calibre.

Please read the tutorial at this link.  https://ebooknice.com/page/post?id=faq


We offer FREE conversion to the popular formats you request; however, this may take some time. Therefore, right after payment, please email us, and we will try to provide the service as quickly as possible.


For some exceptional file formats or broken links (if any), please refrain from opening any disputes. Instead, email us first, and we will try to assist within a maximum of 6 hours.

EbookNice Team

(Ebook) Thinking about Godel and Turing: Essays on complexity, 1970-2007 by Gregory J. Chaitin ISBN 9789812708953, 9812708952

  • SKU: EBN-1007182
Zoomable Image
$ 32 $ 40 (-20%)

Status:

Available

4.4

24 reviews
Instant download (eBook) Thinking about Godel and Turing: Essays on complexity, 1970-2007 after payment.
Authors:Gregory J. Chaitin
Pages:368 pages.
Year:2007
Editon:WS
Publisher:World Scientific Publishing Company
Language:english
File Size:2.51 MB
Format:pdf
ISBNS:9789812708953, 9812708952
Categories: Ebooks

Product desciption

(Ebook) Thinking about Godel and Turing: Essays on complexity, 1970-2007 by Gregory J. Chaitin ISBN 9789812708953, 9812708952

Dr Gregory Chaitin, one of the world's leading mathematicians, is best known for his discovery of the remarkable omega number, a concrete example of irreducible complexity in pure mathematics which shows that mathematics is infinitely complex. In this volume, Chaitin discusses the evolution of these ideas, tracing them back to Leibniz and Borel as well as Gödel and Turing. This book contains 23 non-technical papers by Chaitin, his favorite tutorial and survey papers, including Chaitin's three Scientific American articles. These essays summarize a lifetime effort to use the notion of program-size complexity or algorithmic information content in order to shed further light on the fundamental work of Gödel and Turing on the limits of mathematical methods, both in logic and in computation. Chaitin argues here that his information-theoretic approach to metamathematics suggests a quasi-empirical view of mathematics that emphasizes the similarities rather than the differences between mathematics and physics. He also develops his own brand of digital philosophy, which views the entire universe as a giant computation, and speculates that perhaps everything is discrete software, everything is 0's and 1's. Chaitin's fundamental mathematical work will be of interest to philosophers concerned with the limits of knowledge and to physicists interested in the nature of complexity.
*Free conversion of into popular formats such as PDF, DOCX, DOC, AZW, EPUB, and MOBI after payment.

Related Products