Number theorist Atle Selberg died in Princeton on Monday, at age 90. One of his major results was the “Selberg formula” that led to an elementary proof of the prime number theorem, a Fields medal in 1950, and a famous controversy with Paul Erdos.
Recent Comments
- CS359G Lecture 18: Properties of Expanders | in theory | Peter's ruminations on CS359G Lecture 18: Properties of Expanders
- 4socialmediaconsulting.net on Pseudorandomness and more pseudorandomness
- london flat on Pseudorandomness and more pseudorandomness
- Trinidad on Pseudorandomness and more pseudorandomness
- Cryptanalytical Quantum computing circa 1980; building on 1950s theory | Peter's ruminations on CS359G Lecture 1: Overview
non-theory
theory
Archives
- May 2013
- April 2013
- March 2013
- November 2012
- August 2012
- July 2012
- June 2012
- May 2012
- February 2012
- January 2012
- December 2011
- November 2011
- September 2011
- June 2011
- May 2011
- April 2011
- March 2011
- February 2011
- January 2011
- December 2010
- November 2010
- October 2010
- September 2010
- August 2010
- July 2010
- June 2010
- May 2010
- April 2010
- March 2010
- February 2010
- January 2010
- December 2009
- November 2009
- October 2009
- September 2009
- July 2009
- June 2009
- May 2009
- April 2009
- March 2009
- February 2009
- January 2009
- December 2008
- November 2008
- October 2008
- September 2008
- August 2008
- July 2008
- June 2008
- May 2008
- April 2008
- March 2008
- February 2008
- January 2008
- December 2007
- November 2007
- October 2007
- September 2007
- August 2007
- July 2007
- June 2007
- May 2007
- April 2007
- March 2007
- February 2007
- January 2007
- December 2006
- November 2006
- October 2006
- September 2006
- August 2006
- July 2006
- June 2006
- May 2006
- April 2006
- March 2006
a
Tags
Additive Combinatorics
Apple
Avi Wigderson
CCA security
circuit lower bounds
Conceptual contributions
cryptography
CS254 2010
eigenvalues
Expanders
Fields Medal
FOCS 2006
FOCS 2010
Hard-Core Sets
ICM 2006
Integrality gap
Leonid Levin
linear programming
Luby-Rackoff
maximum flow
Metric embeddings
Oded Goldreich
Proposition 8
pseudorandom function
Pseudorandomness
pseudorandom permutation
public-key encryption
quadratic residue
Random Oracle Model
Regularity Lemma
RSA
SAT
signature schemes
sparsest cut
Spectral partitioning
STOC and FOCS
Szemeredi Theorem
Tamar Ziegler
Terence Tao
things that are excellent
Tim Gowers
Turing Centennial
unique games
World Cup
Zero Knowledge
4 comments
Comments feed for this article
August 10, 2007 at 1:59 pm
Anonymous
Prof. Dorian Goldfeld of Columbia U. has a mathematical description of the Erdos-Selberg issue.
aravind srinivasan
August 10, 2007 at 10:39 pm
Anonymous
If we take Goldfeld’s correspondence at face value, I would have been in favor of joint publication, whether I place myself in the shoes of Erdos or Selberg. Then again the standards of joint authorship are different in CS than in math.
My preference is for the CS standard as it fosters collaborations and limits petty arguments such as Erdos-Selberg.
August 15, 2007 at 5:32 pm
Anonymous
My preference is for the CS standard as it fosters collaborations and limits petty arguments such as Erdos-Selberg.
Well if he got a fields medal for it maybe it wasn’t so petty after all.
August 17, 2007 at 12:43 am
Anonymous
By today’s standards, in Math also, it should have been a collaboration. This happened almost 60 years ago and perhaps things were not so clear cut back then. Plus, as the previous poster stated, the result was a big deal at the time.