Tag Archives: Peter Sarnak

The AC0 Prime Number Conjecture

Posted on February 21, 2011 by Gil Kalai

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 →

	fedja on Chess can be a Game of Lu…
	qm computing summer… on The Race to Quantum Technologi…
	Murat Aygen on Remote Blogging: Efficiency of…
	Gil Kalai on Chess can be a Game of Lu…
	fedja on Chess can be a Game of Lu…
	Solvig Kadison-Singe… on The Kadison-Singer Conjecture…
	Matthew Cory on Call for nominations for the O…
	Matthew Cory on The Race to Quantum Technologi…
	domotorp on Chess can be a Game of Lu…
	Gil Kalai on The Race to Quantum Technologi…
	Notes of the seminar… on Mind Boggling: Following the w…
	Optimal Colorful Tve… on Seven Problems Around Tverberg…

Tag Archives: Peter Sarnak

The AC0 Prime Number Conjecture

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives