Dear all,

You might, perhaps, be interested in the following group study scheme!

Best,

Alex

---------- Forwarded message ---------- From: Owain Evans owain@mit.edu

[snip] ---------------- Hi, I'm a visiting PhD student, working on philosophy and cognitive science. I'm going to be learning some topics in computational complexity theory from the textbook by Barak and Arora (draft copyhttp://www.cs.princeton.edu/theory/complexity/ is free). In particular, randomized algorithms and BPP, interactive proofs, and average-case complexity. If anyone would like to join me, we can arrange a time to meet up, discuss the text and go through some of the problems in the book. I can start now or at the end of term.

How much background is needed? The topics are fairly accessible. Reading the first couple of chapters of the book should suffice as background. Also, if you are interested in other topics in computational complexity or in other areas of theoretical CS (programming language semantics, algorithms or Kolmogorov complexity), then maybe we can plan to cover some other topics also.

Owain Evans owain@mit.edu http://www.mit.edu/~owain/