Customer Review

3 of 3 people found the following review helpful
3.0 out of 5 stars Witty and erudite - but still lecture notes, 17 Oct 2013
Verified Purchase(What is this?)
This review is from: Quantum Computing since Democritus (Paperback)
If you're a computational complexity theorist, then everything looks like .. well, a problem in computational complexity. Scott Aaronson is astonishingly bright, on top of his subject and genuinely droll: this book gives you a fly-on-the-wall view of how he engaged with his students at the University of Waterloo.

We start with a tour of prerequisites. Chapter 2 covers axiomatic set theory (ZF); chapter 3 Gödel's Completeness and Incompleteness Theorems, and Turing Machines. In chapter 4 we apply some of these ideas to artificial intelligence, discuss Turing's Imitation Game and the state of the art in chatbots, and also Searle's Chinese Room puzzle. Aaronson invariably provides a fresh perspective on these familiar topics although already we see the `lecture note' character of this book, where details are hand-waved over (because the students already know this stuff, or they can go away and look it up).

Chapters 5 and 6 introduce us to the elementary computation complexity classes and explain the famous P not = NP conjecture. This is not a first introduction - you are assumed to already understand formal logic and concepts such as clauses, validity and unsatisfiability. Chapters 7 and 8 introduce, by way of a discussion on randomness and probabilistic computation, a slew of new complexity classes and the hypothesised relations between them, applying some of these ideas to cryptanalysis.

Chapter 9 brings us to quantum theory. Six pages in we're talking about qubits, norms and unitary matrices so a first course on quantum mechanics under your belt would help here. The author's computer science take on all this does bring in some refreshing new insights. We're now equipped, in chapter 10, to talk about quantum computing. Typically this is not architecture or engineering discussion; Aaronson is a theorist, and for his community, quantum computing means a new set of complexity classes with conjectural relationships to those of classical computation.

We now go off at a tangent as the author critiques Sir Roger Penrose's views on consciousness as a quantum gravity phenomenon. I think it's fair to say that no-one in AI takes this idea seriously, but the author has the intellectual resources to engage Penrose on his own ground here.

In chapter 12 we crank up the technical level to talk about decoherence and hidden variable theories. This is one of the most interesting chapters but is too discursive - really important concepts are touched on and then abandoned; for example the discussion of decoherence and the 2nd Law of Thermodynamics is set against a model of the multiverse, but it's never quite clear whether Aaronson is assuming the reality of the Everett Interpretation or whether he has some other, more purely mathematical model in mind.

Chapter 12 reminds us that a computational complexity theorist's idea of proof is a long way from that of a logician. We plunge into stochastic proofs, zero-knowledge proofs and probabilistically checkable proofs, all framed by a complexity analysis.

The next few chapters cover a series of topics in similar vein: quantum proofs (and their complexity classes), rebuttals of sceptical arguments against quantum computing (interesting and convincing), some technically demanding material on learning algorithms, and concepts of interactive proof.

The final few chapters are more philosophical: Aaronson applies his toolkit to topics such as the Anthropic Principle (via Bayesian reasoning); free will (he's in favour but has a highly-idiosyncratic view of what free will is); time travel (how closed timelike curves impact on classical and quantum computation); and cosmology (black holes, the information paradox, with firewalls bringing us up-to-date).

I have to say that I did finish this book - it didn't just sit on my coffee table, abandoned after the first few chapters, as the author rather fears in his preface. However, it has to be said that despite the author's undeniable enthusiasm, complexity theory remains a minority taste. There are plenty of insights and novel observations even for those of us less enthralled but I hope it's clear what kind of background the reader needs to get anything out of this volume.

To be fair, the book is already 362 pages long and to make the material less a write-up of post-graduate lecture notes and more a self-contained and smoothly-developed presentation of Aaronson's many original insights would seem to require an inordinate amount of time and effort, without substantially increasing the likely readership. I enjoyed it, but not without a degree of frustration.
Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No

Be the first person to comment on this review.

[Add comment]
Post a comment
To insert a product link use the format: [[ASIN:ASIN product-title]] (What's this?)
Amazon will display this name with all your submissions, including reviews and discussion posts. (Learn more)
Name:
Badge:
This badge will be assigned to you and will appear along with your name.
There was an error. Please try again.
Please see the full guidelines ">here.

Official Comment

As a representative of this product you can post one Official Comment on this review. It will appear immediately below the review wherever it is displayed.   Learn more
The following name and badge will be shown with this comment:
 (edit name)
After clicking on the Post button you will be asked to create your public name, which will be shown with all your contributions.

Is this your product?

If you are the author, artist, manufacturer or an official representative of this product, you can post an Official Comment on this review. It will appear immediately below the review wherever it is displayed.  Learn more
Otherwise, you can still post a regular comment on this review.

Is this your product?

If you are the author, artist, manufacturer or an official representative of this product, you can post an Official Comment on this review. It will appear immediately below the review wherever it is displayed.   Learn more
 
System timed out

We were unable to verify whether you represent the product. Please try again later, or retry now. Otherwise you can post a regular comment.

Since you previously posted an Official Comment, this comment will appear in the comment section below. You also have the option to edit your Official Comment.   Learn more
The maximum number of Official Comments have been posted. This comment will appear in the comment section below.   Learn more
Prompts for sign-in
 


Review Details

Item

3.9 out of 5 stars (7 customer reviews)
5 star:
 (3)
4 star:
 (1)
3 star:
 (2)
2 star:
 (1)
1 star:    (0)
 
 
 
£26.99 £24.99
Add to basket Add to wishlist
Reviewer


Location: Wells, UK

Top Reviewer Ranking: 5,998