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 →

Posted in Computer Science and Optimization, Number theory | Tagged Analytic number theory, Ben Green, Bounded depth circuits, Circuit complexity, Jean Bourgain, Mathoverflow, Peter Sarnak, Prime number theorem | 16 Comments

	Gil Kalai on Physics Related News: Israel J…
	My Notices AMS Paper… on Three Remarkable Quantum Event…
	My Notices AMS Paper… on The Quantum Computer Puzzle @…
	My Notices AMS Paper… on Random Circuit Sampling: Fouri…
	My Notices AMS Paper… on Photonic Huge Quantum Advantag…
	My Notices AMS Paper… on Ordinary computers can beat Go…
	My Notices AMS Paper… on Amazing: Feng Pan and Pan Zhan…
	Gil Kalai on Three Remarkable Quantum Event…
	Arturo Merino, Torst… on Updates from Cambridge
	ryeguy10 on Updates from Cambridge
	Gil Kalai on Updates from Cambridge
	Gil Kalai on Updates from Cambridge

Tag Archives: Peter Sarnak

The AC0 Prime Number Conjecture

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives