Tag Archives: Peter Sarnak

The AC0 Prime Number Conjecture

Posted on February 21, 2011 by

Möbius randomness and computational complexity Last spring Peter Sarnak gave a thought-provoking lecture in Jerusalem. (Here are the very interesting slides of a similar lecture at I.A.S.) Here is a variation of the type of questions Peter has raised. The Prime … Continue reading →

Posted in Algebra and Number Theory, Computer Science and Optimization | Tagged , , , , | 13 Comments