From Wikipedia, the free encyclopedia
Scott Joel Aaronson (born May 21, 1981)
is a theoretical computer
scientist and faculty member in the Electrical Engineering and Computer Science
department at the Massachusetts
Institute of Technology.
He obtained his B.Sc. in computer science from Cornell
University in 2000,
and his Ph.D. at the University of
California, Berkeley in 2004, under the supervision of Umesh
After postdoctorates at the Institute for Advanced
Study and the University of Waterloo, he took
a faculty position at MIT in 2007.
His primary area of research is quantum computing
and computational complexity
theory more generally.
He is a founder of the Complexity Zoo wiki, which catalogs all classes of
complexity. He is
the author of the much-read blog
"Shtetl-Optimized" as well as the essay Who Can Name The Bigger
latter work, widely distributed in academic computer science, uses the concept of
Busy Beaver Numbers as described by Tibor
Rado to illustrate the limits of computability in a pedagogic environment.
An article of Aaronson's, "The Limits of Quantum Computers", was
published in Scientific American,
and he was a guest speaker at the 2007 Foundational Questions in Science Institute
Aaronson is frequently cited in non-academic press, such as Science News, The Age, ZDNet,
New York Times,
and Forbes Magazine.
Aaronson was the subject of media attention in October 2007,
when he accused an advertising agency of plagiarizing a
lecture he wrote on quantum mechanics in an advertisement
He alleged that a commercial for Ricoh Australia by
Sydney-based agency Love Communications appropriated content almost
verbatim from the lecture.
Aaronson received an apologetic email from the agency in which they
claimed to have sought legal advice and did not believe that they
were in violation of his copyright. Unsatisfied, Aaronson pursued
the matter, and the agency settled the dispute without admitting
wrongdoing by making a charitable contribution to two science
organizations of his choice.
- ^ Aaronson, Scott. "Scott Aaronson".
- ^ a
CV from Aaronson's web
Scott Joel Aaronson at the
Automata, Computability and Complexity by Elaine Rich
(2008) ISBN 0132288060, p. 589, section "The
The Complexity Zoo page at
Qwiki (a quantum physics wiki, Stanford University)
- ^ Aaronson, Scott (February 2008). "The Limits of Quantum
Computers". Scientific American. http://www.sciam.com/article.cfm?id=the-limits-of-quantum-computers.
"Foundational Questions in
Science Institute conference". The Science Show. ABC
Radio. 18 August 2007. http://www.abc.net.au/rn/scienceshow/stories/2007/2007888.htm. Retrieved
Peterson, Ivars (November 20, 1999).
"Quantum Games". Science News
(Science Service) 156 (21): 334. http://www.sciencenews.org/sn_arc99/11_20_99/bob2.htm. Retrieved
Franklin, Roger (November 17, 2002). "Two-digit theory gets two
Age. http://www.theage.com.au/articles/2002/11/16/1037080961482.html. Retrieved
Judge, Peter (November 9, 2007). "D-Wave's quantum computer
ready for latest demo". ZDNet. CNET. http://news.zdnet.com/2100-9584_22-175054.html. Retrieved
Dawson, Keith (November 29, 2008). "Improving Wikipedia Coverage
of Computer Science". Slashdot. http://news.slashdot.org/news/08/11/29/1814222.shtml. Retrieved
Brooks, Michael (March 31, 2007). "Outside of time: The quantum
gravity computer". New Scientist (2597). http://www.newscientist.com/article/mg19325971.500-outside-of-time-the-quantum-gravity-computer.html?full=true.
- ^ Pontin, Jason (April 8, 2007). "A Giant Leap Forward in
Computing? Maybe Not". The New York Times (The New York Times
Company). http://www.nytimes.com/2007/04/08/business/yourmoney/08slip.html?pagewanted=all. Retrieved
"Your World View Doesn't
Compute". December 12, 2008. http://www.forbes.com/sciencesandmedicine/2008/12/10/hot-topics-contradictions-tech-sciences_cz_lg_1211gomes.html.
- ^ Tadros, Edmund (October 3, 2007). "Ad agency cribbed my lecture
notes: professor". The Age. http://www.theage.com.au/news/technology/hey-thats-my-lecture/2007/10/03/1191091161163.html?page=fullpage#contentSwap1. Retrieved
- ^ a
Tadros, Edmund (December 20, 2007). "Ad company settles
plagiarism complaint". The Age. http://www.theage.com.au/news/web/ad-company-settles-plagiarism-complaint/2007/12/24/1198344929937.html?page=fullpage#contentSwap1. Retrieved