Gödel's way : exploits into an undecidable world /

This is not a conventional book on science; rather, it is the three authors' personal journey through the world of Godel's theorem and computational complexity. Chaitin, a mathematician/computer scientist, da Costa, a logician, and Doria, a physicist, briefly introduce Godel's theorem and Turing machines, and in the rest of the book they explain their views on what these two topics mean for their respective fields. There are no formal definitions, theorems, or detailed proofs. But there are audacious predictions, which would surprise most complexity theorists. One such prediction is that P=NP, or, at the very least, if P=NP, then it will be easy to prove (in some sense); whereas if PM. Bona University of Florida