Goodreads helps you keep track of books you want to read.
Start by marking “Meta Math!: The Quest for Omega (Peter N. Nevraumont Books)” as Want to Read:
Meta Math!: The Quest for Omega (Peter N. Nevraumont Books)
Enlarge cover
Rate this book
Clear rating
Open Preview

Meta Math!: The Quest for Omega (Peter N. Nevraumont Books)

3.57 of 5 stars 3.57  ·  rating details  ·  171 ratings  ·  22 reviews

Gregory Chaitin, one of the world’s foremost mathematicians, leads us on a spellbinding journey, illuminating the process by which he arrived at his groundbreaking theory.

Chaitin’s revolutionary discovery, the Omega number, is an exquisitely complex representation of unknowability in mathematics. His investigations shed light on what we can ultimately know about the univer

Hardcover, 240 pages
Published October 4th 2005 by Pantheon (first published 2005)
more details... edit details

Friend Reviews

To see what your friends thought of this book, please sign up.

Reader Q&A

To ask other readers questions about Meta Math!, please sign up.

Be the first to ask a question about Meta Math!

This book is not yet featured on Listopia. Add this book to your favorite list »

Community Reviews

(showing 1-30 of 396)
filter  |  sort: default (?)  |  rating details
Amazingly bad. Certainly the worst book on any technical subject I've ever read - try to imagine the book a Jack Russel Terrier would write about its favorite tennis ball. Enthusiasm for a technical subject is important, using ten exclamation points a page (at times every sentence in a paragraph!) is Reader Abuse. The flow of every page is broken up and littered with distractingly bolded sentences, unnecessary subheadings, and redundant information boxes.

Chaitin takes every opportunity to remind
David Rim
Jun 15, 2007 David Rim rated it 3 of 5 stars  ·  review of another edition
Recommends it for: noone in particular
I'm not sure how I feel about the Quest for Omega. On the one hand its interesting in the sense that so many mathematical fields are coming together under the auspices of information / computational theory. On the other, this is weirdly unbalanced. There are really difficult concepts that are totally glossed over, and really simple concepts that are delved into. Im not being pretentious, but diophantine equations are pretty much passed by really quickly and then theres a whole chapter on Turings ...more
Maurizio Codogno
Gregory Chaitin si definisce un matematico quasi-empirista, filosofeggiante sulle orme di Leibnitz. Non credetegli troppo, se non per la parte filosofica. In questo libro più che di matematica si parla di metamatematica, e l'unica parte che può essere vista come empirista è data dal fatto che le dimostrazioni sono generalmente evitate, e Chaitin preferisce fare dei bei riquadroni manco avesse da fare dei lucidi. Il sottotitolo del libro, "Alla ricerca di Omega", è dovuto al fatto che il culmine ...more
If your math education petered out as mine did in the early going of calculus, there is quite a lot here that will either be very heavy going or will go right past you. Fortunately those parts aren't completely essential to appreciating the work. Chaitin is mostly trying to give the layman some understanding of the deepest insights we have into complexity and uncertainty, two notions that sort of meet at the concept of computability. Personally I'm at peace with the idea that I will never truly ...more
Luca Mauri
Questo libro commette due tra i peggiori errori possibili nella divulgazione: non spiega niente e l'autore inserisce continuamente note personali che non sono collegate alla sua supposta scoperta. Il libro dovrebbe condurre il lettore alla scopera di Omega, peccato che prima di introdurre il concetto il libro sia gi�� bello e finito, nel mezzo ci sono una serie di concetti che spaziano dalla matematica alla logica all'informatica alla biologia che sono debolmente legati.
L'autore fa diverse dimos
Chaitin has a way of making his conclusions sound less than earthshaking. As far as I can see, the main point of this book is that we can't expect to get something truly complex out of something simple. I think I got a lot out of this book though, because Chaitin also points out a number of less obvious implications for math, computer science, and physics. Its hard to tell just how well presented the specifics are, because I don't have a background in computer science. This combined with a highl ...more
Jul 20, 2008 Chris rated it 4 of 5 stars  ·  review of another edition
Recommended to Chris by: Aaron Thomas
I had been reading and learning about Godel's Incompleteness theorem when a friend recommended this book to me. Also a book about incompleteness, this text focuses on the field of computer science-and on the computer itself as a philosophical/mathematical device-instead of discussing Godel's arduous proof. The most interesting idea I gathered from this book is this: mathematics may be more human invention than universal law. I would highly recommend it, especially as it is short and Chaitin's en ...more
Great ideas dealt with at a high level. Sometimes a little more depth would be appropriate.
Fascinating book giving novel insight to the measurement of complexity.
Chaitin makes a good effort to explain his mathematics here but books like this never quite succeed. If you really want to grok Omega you have to study his professional publications and that's rough sledding. I liked his observation that if a theorem is true there will be many proofs and if it isn't there will be none! "Diversity" hasn't conquered mathematics - yet.
Roger B
Written at a (frustratingly) high level, interesting ideas that touch on a number of math areas (Diophantine equations, information complexity, irreducibility, randomness, computer programming) as well as philosophical ones as well.
Probably one of the most fascinating math books I've ever read. I'm not sure I fully understood every part of it, but it was heartening that Chaitin wasn't afraid to include equations liberally in the text. A really interesting topic for those who enjoy the work of Georg Cantor.
Sean Brooks
Interesting subject about omega, which is the search for how much a binary system can 'know', compute, and but although Chaitin is very smart I don't agree with some of his optimism with what math can do, so me and him don't see eye to eye on his attempts to find omega.
One of the best pieces I have ever read on Godel's Incompleteness Theorem and what it means to computability. Algorithmic complexity CAN NOT be determined formally. This should be required reading for all computer engineering majors.
Alexi Parizeau
This book has changed the way I approach my research. Chaitin's attitude and philosophy are contagious! It's now one of the most important books I've read, if only because it allowed me to be myself in the pursuit of truth.
Despite his obnoxious prose, Chaitin has so damn many fascinating ideas that you can't help being drawn in. I think this book would have appeal to non-geeky math types, but I've been wrong about that before.
Mr chaitin book show that he is thinks a lot of himself. He is not in the same conversation that contains Gödel or Hilbert. Not even close
I learned some very remarkable new things about the real number system, from this book.
Dec 12, 2011 Laura marked it as to-read  ·  review of another edition
I'm approaching this with a great deal of skepticism.
Worakarn Isaratham
interesting content, awful writing.
Nathan Letwory
Interesting book on maths
Beautiful exposition of Algorithmic Information Theory and why Goedel's world-shaking result of 1931 is not an anomaly but ever so much more of a rule. Hilbert's program to capture everything in a Formal Axiomatic System was dashed but human creativity was unleashed. An anthem to a kind of joie de vivre.
Mar 26, 2009 Sean marked it as to-read
Ilya Limberger
Ilya Limberger marked it as to-read
Mar 02, 2015
Nicolás Bitar
Nicolás Bitar marked it as to-read
Mar 02, 2015
Sandra is currently reading it
Feb 23, 2015
Telorian marked it as to-read
Feb 10, 2015
Michelle marked it as to-read
Feb 08, 2015
Lisa Redmond
Lisa Redmond marked it as to-read
Feb 03, 2015
Nicole Smith
Nicole Smith marked it as to-read
Jan 31, 2015
« previous 1 3 4 5 6 7 8 9 13 14 next »
There are no discussion topics on this book yet. Be the first to start one »
  • The Riemann Hypothesis: The Greatest Unsolved Problem in Mathematics
  • The Colossal Book of Mathematics
  • The Mathematical Experience
  • Coincidences, Chaos, and All That Math Jazz: Making Light of Weighty Ideas
  • 50 Mathematical Ideas You Really Need to Know
  • The Book of Numbers
  • The Language of Mathematics: Making the Invisible Visible
  • e: the Story of a Number
  • Concepts of Modern Mathematics
  • One to Nine: The Inner Life of Numbers
  • Where Mathematics Come From: How the Embodied Mind Brings Mathematics into Being
  • The Universal Computer: The Road from Leibnitz to Turing
  • Real Analysis
  • Incompleteness: The Proof and Paradox of Kurt Gödel (Great Discoveries)
  • The Mathematical Universe: An Alphabetical Journey Through the Great Proofs, Problems, and Personalities
  • Prime Obsession: Bernhard Riemann and the Greatest Unsolved Problem in Mathematics
  • Calculus Made Easy
  • From the Closed World to the Infinite Universe
The Limits of Mathematics: A Course on Information Theory and the Limits of Formal Reasoning Conversations with a Mathematician: Math, Art, Science and the Limits of Reason The Unknowable Information, Randomness and Incompleteness: Papers on Algorithmic Information Theory (2nd Edition) Thinking about Godel and Turing: Essays on Complexity, 1970-2007

Share This Book