Thinking about Godel and Turing: Essays on Complexity, 1970-2007

Paperback (Print)
Buy New
Buy New from BN.com
$78.57
Used and New from Other Sellers
Used and New from Other Sellers
from $69.01
Usually ships in 1-2 business days
(Save 20%)
Other sellers (Paperback)
  • All (3) from $69.01   
  • New (2) from $69.01   
  • Used (1) from $109.74   

Overview

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 Godel 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 Godel 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.

Read More Show Less

Product Details

  • ISBN-13: 9789812708960
  • Publisher: World Scientific Publishing Company, Incorporated
  • Publication date: 8/28/2007
  • Pages: 368
  • Product dimensions: 7.00 (w) x 10.00 (h) x 0.80 (d)

Table of Contents


Introductory note     1
On the difficulty of computations: IEEE Transactions on Information Theory, 1970     3
Information-theoretic computational complexity: IEEE Transactions on Information Theory, 1974     17
Randomness and mathematical proof: Scientific American, 1975     31
Godel's theorem and information: International Journal of Theoretical Physics, 1982     47
Randomness in arithmetic: Scientific American, 1988     65
Randomness in arithmetic and the decline & fall of reductionism in pure mathematics: Bulletin of the European Association for Theoretical Computer Science, 1993     75
A century of controversy over the foundations of mathematics: Calude & Paun, Finite versus Infinite, 2000     99
A century of controversy over the foundations of mathematics: Complexity, 2000     129
Metamathematics and the foundations of mathematics: Bulletin of the European Association for Theoretical Computer Science, 2002     153
Paradoxes of randomness: Complexity, 2002     169
Two philosophical applications of algorithmic information theory: Lecture Notes in Computer Science, 2003     189
On the intelligibility of the universe and the notions of simplicity, complexity and irreducibility: Hogrebe & Bromand, Grenzen und Grenzuberschreitungen, 2004     201
Leibniz, information, math & physics: Loffler & Weingartner, Wissen und Glauben,2004     227
Leibniz, randomness & the halting probability: Mathematics Today, 2004     241
Complexity & Leibniz: Academie Internationale de Philosophie des Sciences, Tenerife, 2005     247
The limits of reason: Scientific American, 2006     251
How real are real numbers?: International Journal of Bifurcation and Chaos, 2006     267
Epistemology as information theory: From Leibniz to [Omega]: Collapse: Journal of Philosophical Research and Development, 2006     281
Is incompleteness a serious problem?: Lolli & Pagallo, La complessita di Godel, 2007     299
Speculations on biology, information & complexity: Bulletin of the European Association for Theoretical Computer Science, 2007     303
How much information can there be in a real number?: International Journal of Bifurcation and Chaos, 2007     313
The halting probability [Omega]: Irreducible complexity in pure mathematics: Milan Journal of Mathematics, 2007     319
The halting probability [Omega]: Concentrated creativity: Obrist, Formulas for the Twenty-First Century, 2007     333
List of publications     335
Acknowledgements     343
About the author     347
Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)