Aaronson, Scott
Overview
Works:  10 works in 30 publications in 4 languages and 668 library holdings 

Genres:  Academic theses 
Roles:  Author, Editor 
Publication Timeline
.
Most widely held works by
Scott Aaronson
Quantum computing since Democritus by
Scott Aaronson(
Book
)
18 editions published between 2013 and 2015 in English and held by 648 WorldCat member libraries worldwide
Written by noted quantum computing theorist Scott Aaronson, this book takes readers on a tour through some of the deepest ideas of maths, computer science and physics. Full of insights, arguments and philosophical perspectives, the book covers an amazing array of topics. Beginning in antiquity with Democritus, it progresses through logic and set theory, computability and complexity theory, quantum computing, cryptography, the information content of quantum states and the interpretation of quantum mechanics. There are also extended discussions about time travel, Newcomb's Paradox, the anthropic principle and the views of Roger Penrose. Aaronson's informal style makes this fascinating book accessible to readers with scientific backgrounds, as well as students and researchers working in physics, computer science, mathematics and philosophy"
18 editions published between 2013 and 2015 in English and held by 648 WorldCat member libraries worldwide
Written by noted quantum computing theorist Scott Aaronson, this book takes readers on a tour through some of the deepest ideas of maths, computer science and physics. Full of insights, arguments and philosophical perspectives, the book covers an amazing array of topics. Beginning in antiquity with Democritus, it progresses through logic and set theory, computability and complexity theory, quantum computing, cryptography, the information content of quantum states and the interpretation of quantum mechanics. There are also extended discussions about time travel, Newcomb's Paradox, the anthropic principle and the views of Roger Penrose. Aaronson's informal style makes this fascinating book accessible to readers with scientific backgrounds, as well as students and researchers working in physics, computer science, mathematics and philosophy"
Limits on efficient computation in the physical world by
Scott Aaronson(
)
3 editions published in 2004 in English and held by 9 WorldCat member libraries worldwide
More than a speculative technology, quantum computing seems to challenge our most basic intuitions about how the physical world should behave. In this thesis I show that, while some intuitions from classical computer science must be jettisoned in the light of modern physics, many others emerge nearly unscathed; and I use powerful tools from computational complexity theory to help determine which are which
3 editions published in 2004 in English and held by 9 WorldCat member libraries worldwide
More than a speculative technology, quantum computing seems to challenge our most basic intuitions about how the physical world should behave. In this thesis I show that, while some intuitions from classical computer science must be jettisoned in the light of modern physics, many others emerge nearly unscathed; and I use powerful tools from computational complexity theory to help determine which are which
The thirtyeighth annual ACM Symposium on Theory of Computing (STOC 2006) : [Scott Aaronson ..., guest ed.] by
2006, Seattle, Wash.> Symposium on Theory of Computing. <38(
Book
)
2 editions published between 2009 and 2010 in English and held by 3 WorldCat member libraries worldwide
2 editions published between 2009 and 2010 in English and held by 3 WorldCat member libraries worldwide
Special issue: the ThirtyEighth Annual ACM Symposium on Theory of Computing (STOC 2006) : [... which was held May 2123,
2006, in Seattle, Washington](
Book
)
1 edition published in 2009 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2009 in English and held by 2 WorldCat member libraries worldwide
Granice kwantowej informatyki by
Scott Aaronson(
)
1 edition published in 2008 in Polish and held by 1 WorldCat member library worldwide
1 edition published in 2008 in Polish and held by 1 WorldCat member library worldwide
Holo 2 : emerging trajectories in art, science, and technology by
Casey Reas(
Book
)
1 edition published in 2016 in English and held by 1 WorldCat member library worldwide
1 edition published in 2016 in English and held by 1 WorldCat member library worldwide
Los limites de la computacion cuantica by
Scott Aaronson(
)
1 edition published in 2008 in Spanish and held by 1 WorldCat member library worldwide
1 edition published in 2008 in Spanish and held by 1 WorldCat member library worldwide
Ingong jineung(
Book
)
1 edition published in 2016 in Korean and held by 1 WorldCat member library worldwide
1 edition published in 2016 in Korean and held by 1 WorldCat member library worldwide
Quantum complexity and fundamental physics by
Scott Aaronson(
Visual
)
1 edition published in 2009 in English and held by 1 WorldCat member library worldwide
"What are the ultimate limits on what can feasibly be computed in the physical world? In this talk, I'll try to show how this question ties together many of the central concerns of math, computer science, and physics. I'll also explain how research in quantum computing has transformed our understanding of the question over the last fifteen years. Finally, I'll offer a concrete conjecture  that there is no physical means to solve certain computationally complex problems (NPcomplete)  and discuss the evidence for this conjecture, as well as the implications for physics if it's accepted. Scott Aaronson, Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology."NIST Technicalendar announcement
1 edition published in 2009 in English and held by 1 WorldCat member library worldwide
"What are the ultimate limits on what can feasibly be computed in the physical world? In this talk, I'll try to show how this question ties together many of the central concerns of math, computer science, and physics. I'll also explain how research in quantum computing has transformed our understanding of the question over the last fifteen years. Finally, I'll offer a concrete conjecture  that there is no physical means to solve certain computationally complex problems (NPcomplete)  and discuss the evidence for this conjecture, as well as the implications for physics if it's accepted. Scott Aaronson, Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology."NIST Technicalendar announcement
Special section: Foundations of computer science : [49th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2008)
in Philadelphia, Pennsylvania, October 2628,2008](
Book
)
1 edition published in 2011 in English and held by 1 WorldCat member library worldwide
1 edition published in 2011 in English and held by 1 WorldCat member library worldwide
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 University of California, Berkeley
 Symposium on Theory of Computing (38, 2006, Seattle, Wash.)
 Association for Computing Machinery Special Interest Group on Algorithms and Computation Theory
 Raley, Yvonne
 Sterling, Thomas
 Mims, Christopher
 Weinberger, David
 AbuMostafa, Yaser S.
 Anderson, Susan Leigh
 김일선
Useful Links
Associated Subjects
Art and technology ArtsExperimental methods Computational complexity Computer artTechnique ElectronicsMaterials Image processingDigital techniques Information display systems NPcomplete problems Physics Quantum computers Quantum theoryMathematics University of California, Berkeley.Computer Science Division
Alternative Names
Scott Aaronson
Scott Aaronson American scientist, working on the field of quantum computing
Scott Aaronson Amerikaans informaticus
Scott Aaronson informatico e divulgatore scientifico statunitense
Scott Aaronson USamerikanischer Informatiker
Ааронсон, Скотт
اسکات آرانسان دانشمند علوم کامپیوتر و دانشمند آمریکایی
سكوت آرنسون عالم امريكي، يعمل بالحوسبة الكمية ونظرية الحوسبة المعقدة
സ്കോട്ട് ആരോൺസൺ
スコット・アーロンソン
Languages