33:
520:. I watched Fiddler many times as a kid, both the movie and the play. And every time, there was a jolt of recognition, like: "So that's the world I was designed to inhabit. All the aspects of my personality that mark me out as weird today, the obsessive reading and the literal-mindedness and even the rocking back and forth—I probably have them because back then they would've made me a better
329:. He enrolled in a school there that permitted him to skip ahead several years in math, but upon returning to the US, he found his education restrictive, getting bad grades and having run-ins with teachers. He enrolled in The Clarkson School, a
368:
at age 11, and felt he lagged behind peers, who had already been coding for years. In part due to
Aaronson getting into advanced mathematics before getting into computer programming, he felt drawn to theoretical computing, particularly
572:
and more. Many of these interdisciplinary applications of computational complexity were later fleshed out in his article, "Why
Philosophers Should Care About Computational Complexity". Since then, Aaronson published a book entitled
1639:
400:
as David J. Bruton Jr. Centennial
Professor of Computer Science and as the founding director of UT Austin's new Quantum Information Center. In summer 2022 he announced he would be working for a year at
1541:
1609:
1248:
440:
556:
He has also taught a graduate-level survey course, "Quantum
Computing Since Democritus", for which notes are available online, and have been published as a book by
1614:
1174:
1664:
880:
1659:
1549:
1045:
393:, he took a faculty position at MIT in 2007. His primary area of research is quantum computing and computational complexity theory more generally.
1496:
1669:
593:
1629:
1599:
1634:
802:
373:. At Cornell, he became interested in quantum computing and devoted himself to computational complexity and quantum computing.
1649:
429:
for the papers "Limitations of
Quantum Advice and One-Way Communication" (2004) and "Quantum Certificate Complexity" (2003).
209:
1438:
1119:
1619:
426:
1604:
575:
350:
100:
1115:
653:
337:, which enabled Aaronson to apply for colleges while only in his freshman year of high school. He was accepted into
1515:
433:
1674:
481:
370:
282:
187:
1569:
868:
397:
278:
204:
1654:
386:
274:
214:
935:
557:
464:
He was awarded the 2020 ACM Prize in
Computing "for groundbreaking contributions to quantum computing".
1644:
1007:"The Presidential Early Career Award for Scientists and Engineers: Recipient Details: Scott Aaronson"
675:
446:
1006:
1249:"Quantum Computing Democritus :: Quantum physics, quantum information and quantum computation"
1411:
534:
He also wrote the essay "Who Can Name The Bigger Number?". The latter work, widely distributed in
1334:
1624:
419:
390:
219:
167:
152:
1058:
932:
NSF to Honor Two Early Career
Researchers in Computational Science With Alan T. Waterman Award
742:
508:
Eastern Europe. They're where all my ancestors came from—some actually from the same place (
1594:
1300:
365:
8:
1138:
584:
569:
517:
489:
452:
334:
1365:
1304:
1200:
1060:
2019 ACM Fellows
Recognized for Far-Reaching Accomplishments that Define the Digital Age
931:
1473:
1385:
1271:
1270:
Aaronson, Scott (2011). "Why
Philosophers Should Care About Computational Complexity".
626:
542:
338:
322:
95:
1312:
978:
1316:
1111:
561:
286:
191:
1377:
1308:
538:
342:
330:
229:
162:
1450:
784:
SBF and I both grew up as nerdy kids in middle-class Jewish
American families,...
346:
298:
139:
364:
at the age of 11, provoked by symbols in a babysitter's textbook. He discovered
1020:
354:
234:
126:
1640:
Recipients of the Presidential Early Career Award for Scientists and Engineers
1081:
582:
An article of Aaronson's, "The Limits of Quantum Computers", was published in
461:
in 2019 "for contributions to quantum computing and computational complexity".
360:
Aaronson had shown ability in mathematics from an early age, teaching himself
1588:
1565:
1342:
992:
864:
840:
620:
589:
550:
382:
314:
121:
71:
703:
596:
conference. Aaronson is frequently cited in the non-academic press, such as
546:
1320:
1226:
1130:
661:
598:
513:
67:
63:
32:
436:
for the paper "Lower Bounds for Local Search by Quantum Arguments" (2004).
1107:
717:"Statement of Jewish scientists opposing the "judicial reform" in Israel"
565:
881:"OpenAI is developing a watermark to identify work from its GPT text AI"
826:
560:. It weaves together disparate topics into a cohesive whole, including
1389:
1175:"Scott Aaronson Answers Every Ridiculously Big Question I Throw at Him"
458:
906:
767:
716:
505:
406:
326:
82:
1381:
1291:
Aaronson, Scott (February 2008). "The Limits of Quantum Computers".
1276:
614:
535:
361:
1574:
604:
509:
257:
116:
1151:
633:
521:
501:
402:
277:
and Schlumberger Centennial Chair of Computer Science at the
157:
1579:
249:
1134:
609:
353:, for his PhD, which he got in 2004 under the supervision of
441:
Presidential Early Career Award for Scientists and Engineers
1446:
477:
318:
302:
1335:"Foundational Questions in Science Institute conference"
967:. Computational Complexity Conference. pp. 171–178.
952:. Computational Complexity Conference. pp. 320–332.
1610:
2019 fellows of the Association for Computing Machinery
950:
Limitations of Quantum Advice and One-Way Communication
484:. He is the author of the blog "Shtetl-Optimized".
1474:"Improving Knowledge Coverage of Computer Science"
1207:. Electrical Engineering and Computer Science, MIT
768:"Sam Bankman-Fried and the geometry of conscience"
1439:"D-Wave's quantum computer ready for latest demo"
1021:"Six junior faculty named Sloan Research Fellows"
1586:
832:
325:turned public-relations executive—was posted to
1497:"Outside of time: The quantum gravity computer"
1290:
962:
947:
396:In the summer of 2016 he moved from MIT to the
1615:Institute for Advanced Study visiting scholars
1516:"A Giant Leap Forward in Computing? Maybe Not"
1219:
1471:
1144:
1263:
1227:"PHYS771 Quantum Computing Since Democritus"
698:
696:
432:Danny Lewin Best Student Paper Award at the
594:Foundational Questions in Science Institute
497:, and about his preoccupation to the past:
418:Aaronson is one of two winners of the 2012
308:
1284:
297:Aaronson is married to computer scientist
31:
1665:UC Berkeley College of Engineering alumni
1275:
1241:
938:, March 8, 2012, retrieved March 8, 2012.
796:
794:
792:
693:
117:Quantum Turing machine with postselection
1660:American theoretical computer scientists
1409:
1363:
1269:
838:
800:
16:American computer scientist (born 1981)
1587:
1513:
1494:
1104:Automata, Computability and Complexity
993:"Danny Lewin Best Student Paper Award"
981:. Computational Complexity Conference.
822:
820:
789:
1670:University of Texas at Austin faculty
1539:
1436:
1410:Franklin, Roger (November 17, 2002).
1364:Peterson, Ivars (November 20, 1999).
1086:, Association for Computing Machinery
1063:, Association for Computing Machinery
345:in 2000, and where he resided at the
210:Massachusetts Institute of Technology
1198:
1120:p. 589, section "The Complexity Zoo"
839:Aaronson, Scott (December 5, 2017).
743:"Statement of concern - Signatories"
281:. His primary areas of research are
1507:
1472:Dawson, Keith (November 29, 2008).
1412:"Two-digit theory gets two fingers"
817:
427:Computational Complexity Conference
273:(born May 21, 1981) is an American
13:
1495:Brooks, Michael (March 31, 2007).
1172:
576:Quantum Computing Since Democritus
493:he answers why his blog is called
351:University of California, Berkeley
101:University of California, Berkeley
14:
1686:
1630:MIT School of Engineering faculty
1600:American expatriates in Hong Kong
1559:
1542:"Your World View Doesn't Compute"
1437:Judge, Peter (November 9, 2007).
1313:10.1038/scientificamerican0308-62
1201:"Who Can Name the Bigger Number?"
801:Hardesty, Larry (April 7, 2014).
425:Best Student Paper Awards at the
1540:Gomes, Lee (December 12, 2008).
1376:(21). Science Service: 334–335.
480:, which catalogs all classes of
434:Symposium on Theory of Computing
292:
1533:
1514:Pontin, Jason (April 8, 2007).
1488:
1465:
1430:
1403:
1357:
1327:
1192:
1166:
1124:
1097:
1074:
1051:
1039:
1013:
999:
985:
971:
956:
941:
925:
899:
873:
858:
468:
371:computational complexity theory
341:, where he obtained his BSc in
283:computational complexity theory
188:Computational complexity theory
1635:Quantum information scientists
965:Quantum Certificate Complexity
760:
735:
709:
668:
646:
405:on theoretical foundations of
275:theoretical computer scientist
1:
1570:Mathematics Genealogy Project
1046:Simons Investigators Awardees
979:"Future and Past Conferences"
869:Mathematics Genealogy Project
640:
398:University of Texas at Austin
279:University of Texas at Austin
205:University of Texas at Austin
1650:21st-century science writers
553:in a pedagogic environment.
549:to illustrate the limits of
504:were Jewish villages in pre-
387:Institute for Advanced Study
317:, though he spent a year in
215:Institute for Advanced Study
7:
936:National Science Foundation
10:
1691:
1620:Jewish American scientists
676:"Professor Scott Aaronson"
558:Cambridge University Press
1605:Cornell University alumni
1205:academic personal website
1137:(a quantum physics wiki,
564:, complexity, free will,
447:Sloan Research Fellowship
412:
376:
301:. Aaronson identifies as
244:
240:
228:
197:
183:
176:
145:
135:
109:
88:
78:
42:
30:
23:
963:Aaronson, Scott (2003).
948:Aaronson, Scott (2004).
829:from Aaronson's web site
482:computational complexity
313:Aaronson grew up in the
309:Early life and education
1131:The Complexity Zoo page
1048:, The Simons Foundation
704:"From Boston to Austin"
524:scholar, or something."
473:He is a founder of the
349:. He then attended the
163:Tomassoni–Chisesi Prize
1675:Sloan Research Fellows
680:Constructor University
660:. 2008. Archived from
541:, uses the concept of
532:
420:Alan T. Waterman Award
391:University of Waterloo
220:University of Waterloo
168:ACM Prize in Computing
153:Alan T. Waterman Award
1552:on December 14, 2008.
664:on February 21, 2008.
579:based on the course.
499:
457:He was elected as an
1453:on December 26, 2008
706:, February 28, 2016.
487:In the interview to
366:computer programming
1655:Simons Investigator
1305:2008SciAm.298c..62A
1293:Scientific American
1229:. scottaaronson.com
1179:Scientific American
1154:. scottaaronson.com
1139:Stanford University
1027:. February 17, 2009
865:Scott Joel Aaronson
774:. November 13, 2022
723:. February 16, 2023
585:Scientific American
570:anthropic principle
543:Busy Beaver Numbers
518:fiddler on the roof
490:Scientific American
453:Simons Investigator
335:Clarkson University
271:Scott Joel Aaronson
47:Scott Joel Aaronson
1575:Aaronson's website
1520:The New York Times
1152:"Shtetl-Optimized"
803:"The complexonaut"
658:qwiki.stanford.edu
627:The New York Times
516:, who painted the
339:Cornell University
321:when his father—a
96:Cornell University
1345:. August 18, 2007
1199:Aaronson, Scott.
702:Shetl-Optimized,
562:quantum mechanics
287:quantum computing
268:
267:
192:quantum computing
178:Scientific career
1682:
1645:Science bloggers
1554:
1553:
1548:. Archived from
1537:
1531:
1530:
1528:
1526:
1511:
1505:
1504:
1492:
1486:
1485:
1483:
1481:
1469:
1463:
1462:
1460:
1458:
1449:. Archived from
1434:
1428:
1427:
1425:
1423:
1407:
1401:
1400:
1398:
1396:
1361:
1355:
1354:
1352:
1350:
1339:The Science Show
1331:
1325:
1324:
1288:
1282:
1281:
1279:
1267:
1261:
1260:
1258:
1256:
1245:
1239:
1238:
1236:
1234:
1223:
1217:
1216:
1214:
1212:
1196:
1190:
1189:
1187:
1185:
1170:
1164:
1163:
1161:
1159:
1148:
1142:
1133:(originally) at
1128:
1122:
1101:
1095:
1094:
1093:
1091:
1078:
1072:
1071:
1070:
1068:
1055:
1049:
1043:
1037:
1036:
1034:
1032:
1017:
1011:
1010:
1003:
997:
996:
989:
983:
982:
975:
969:
968:
960:
954:
953:
945:
939:
929:
923:
922:
920:
918:
911:Shtetl-Optimized
903:
897:
896:
894:
892:
877:
871:
862:
856:
855:
853:
851:
845:Shtetl-Optimized
836:
830:
824:
815:
814:
812:
810:
798:
787:
786:
781:
779:
772:Shtetl-Optimized
764:
758:
757:
755:
753:
747:sites.google.com
739:
733:
732:
730:
728:
721:Shtetl-Optimized
713:
707:
700:
691:
690:
688:
686:
672:
666:
665:
654:"Scott Aaronson"
650:
545:as described by
539:computer science
530:
495:shtetl-optimized
343:computer science
331:gifted education
264:
261:
259:
254:
251:
230:Doctoral advisor
60:
56:
54:
37:Aaronson in 2011
35:
21:
20:
1690:
1689:
1685:
1684:
1683:
1681:
1680:
1679:
1585:
1584:
1580:Aaronson's blog
1562:
1557:
1538:
1534:
1524:
1522:
1512:
1508:
1493:
1489:
1479:
1477:
1470:
1466:
1456:
1454:
1435:
1431:
1421:
1419:
1408:
1404:
1394:
1392:
1382:10.2307/4012018
1366:"Quantum Games"
1362:
1358:
1348:
1346:
1333:
1332:
1328:
1289:
1285:
1268:
1264:
1254:
1252:
1251:. cambridge.org
1247:
1246:
1242:
1232:
1230:
1225:
1224:
1220:
1210:
1208:
1197:
1193:
1183:
1181:
1171:
1167:
1157:
1155:
1150:
1149:
1145:
1129:
1125:
1102:
1098:
1089:
1087:
1080:
1079:
1075:
1066:
1064:
1057:
1056:
1052:
1044:
1040:
1030:
1028:
1019:
1018:
1014:
1005:
1004:
1000:
991:
990:
986:
977:
976:
972:
961:
957:
946:
942:
930:
926:
916:
914:
913:. June 17, 2022
905:
904:
900:
890:
888:
879:
878:
874:
863:
859:
849:
847:
837:
833:
825:
818:
808:
806:
799:
790:
777:
775:
766:
765:
761:
751:
749:
741:
740:
736:
726:
724:
715:
714:
710:
701:
694:
684:
682:
674:
673:
669:
652:
651:
647:
643:
588:, and he was a
531:
528:
471:
415:
379:
347:Telluride House
333:program run by
311:
299:Dana Moshkovitz
295:
256:
248:
224:
172:
140:Dana Moshkovitz
131:
105:
89:Alma mater
74:
61:
58:
52:
50:
49:
48:
38:
26:
17:
12:
11:
5:
1688:
1678:
1677:
1672:
1667:
1662:
1657:
1652:
1647:
1642:
1637:
1632:
1627:
1622:
1617:
1612:
1607:
1602:
1597:
1583:
1582:
1577:
1572:
1566:Scott Aaronson
1561:
1560:External links
1558:
1556:
1555:
1532:
1506:
1487:
1464:
1429:
1402:
1356:
1326:
1283:
1262:
1240:
1218:
1191:
1173:Horgan, John.
1165:
1143:
1123:
1096:
1073:
1050:
1038:
1012:
998:
984:
970:
955:
940:
924:
898:
872:
857:
831:
816:
788:
759:
734:
708:
692:
667:
644:
642:
639:
529:Scott Aaronson
526:
475:Complexity Zoo
470:
467:
466:
465:
462:
455:
449:
443:
437:
430:
423:
414:
411:
383:postdoctorates
378:
375:
355:Umesh Vazirani
323:science writer
310:
307:
294:
291:
266:
265:
260:.scottaaronson
246:
242:
241:
238:
237:
235:Umesh Vazirani
232:
226:
225:
223:
222:
217:
212:
207:
201:
199:
195:
194:
185:
181:
180:
174:
173:
171:
170:
165:
160:
155:
149:
147:
143:
142:
137:
133:
132:
130:
129:
127:Boson sampling
124:
119:
113:
111:
110:Known for
107:
106:
104:
103:
98:
92:
90:
86:
85:
80:
76:
75:
62:
46:
44:
40:
39:
36:
28:
27:
25:Scott Aaronson
24:
15:
9:
6:
4:
3:
2:
1687:
1676:
1673:
1671:
1668:
1666:
1663:
1661:
1658:
1656:
1653:
1651:
1648:
1646:
1643:
1641:
1638:
1636:
1633:
1631:
1628:
1626:
1625:Living people
1623:
1621:
1618:
1616:
1613:
1611:
1608:
1606:
1603:
1601:
1598:
1596:
1593:
1592:
1590:
1581:
1578:
1576:
1573:
1571:
1567:
1564:
1563:
1551:
1547:
1543:
1536:
1521:
1517:
1510:
1502:
1501:New Scientist
1498:
1491:
1475:
1468:
1452:
1448:
1444:
1440:
1433:
1417:
1413:
1406:
1391:
1387:
1383:
1379:
1375:
1371:
1367:
1360:
1344:
1340:
1336:
1330:
1322:
1318:
1314:
1310:
1306:
1302:
1298:
1294:
1287:
1278:
1273:
1266:
1250:
1244:
1228:
1222:
1206:
1202:
1195:
1180:
1176:
1169:
1153:
1147:
1140:
1136:
1132:
1127:
1121:
1117:
1116:0-13-228806-0
1113:
1109:
1105:
1100:
1085:
1084:
1077:
1062:
1061:
1054:
1047:
1042:
1026:
1022:
1016:
1008:
1002:
994:
988:
980:
974:
966:
959:
951:
944:
937:
933:
928:
912:
908:
902:
886:
885:New Scientist
882:
876:
870:
866:
861:
846:
842:
835:
828:
823:
821:
804:
797:
795:
793:
785:
773:
769:
763:
748:
744:
738:
722:
718:
712:
705:
699:
697:
685:September 11,
681:
677:
671:
663:
659:
655:
649:
645:
638:
636:
635:
630:
628:
624:
622:
621:New Scientist
618:
616:
611:
608:
606:
602:
600:
595:
591:
590:guest speaker
587:
586:
580:
578:
577:
571:
567:
563:
559:
554:
552:
551:computability
548:
544:
540:
537:
525:
523:
519:
515:
511:
507:
503:
498:
496:
492:
491:
485:
483:
479:
476:
463:
460:
456:
454:
450:
448:
444:
442:
438:
435:
431:
428:
424:
421:
417:
416:
410:
408:
404:
399:
394:
392:
388:
384:
374:
372:
367:
363:
358:
356:
352:
348:
344:
340:
336:
332:
328:
324:
320:
316:
315:United States
306:
304:
300:
293:Personal life
290:
288:
284:
280:
276:
272:
263:
253:
250:scottaaronson
247:
243:
239:
236:
233:
231:
227:
221:
218:
216:
213:
211:
208:
206:
203:
202:
200:
196:
193:
189:
186:
182:
179:
175:
169:
166:
164:
161:
159:
156:
154:
151:
150:
148:
144:
141:
138:
134:
128:
125:
123:
122:Algebrization
120:
118:
115:
114:
112:
108:
102:
99:
97:
94:
93:
91:
87:
84:
81:
77:
73:
72:United States
69:
65:
59:(age 43)
45:
41:
34:
29:
22:
19:
1550:the original
1545:
1535:
1523:. Retrieved
1519:
1509:
1500:
1490:
1478:. Retrieved
1467:
1455:. Retrieved
1451:the original
1442:
1432:
1420:. Retrieved
1415:
1405:
1393:. Retrieved
1373:
1370:Science News
1369:
1359:
1347:. Retrieved
1338:
1329:
1296:
1292:
1286:
1265:
1253:. Retrieved
1243:
1231:. Retrieved
1221:
1209:. Retrieved
1204:
1194:
1182:. Retrieved
1178:
1168:
1156:. Retrieved
1146:
1126:
1103:
1099:
1088:, retrieved
1082:
1076:
1067:December 11,
1065:, retrieved
1059:
1053:
1041:
1029:. Retrieved
1024:
1015:
1001:
987:
973:
964:
958:
949:
943:
927:
917:December 31,
915:. Retrieved
910:
901:
891:December 31,
889:. Retrieved
884:
875:
860:
848:. Retrieved
844:
834:
807:. Retrieved
783:
776:. Retrieved
771:
762:
750:. Retrieved
746:
737:
725:. Retrieved
720:
711:
683:. Retrieved
679:
670:
662:the original
657:
648:
632:
625:
619:
613:
603:
599:Science News
597:
592:at the 2007
583:
581:
574:
555:
533:
514:Marc Chagall
500:
494:
488:
486:
474:
472:
469:Popular work
395:
380:
359:
312:
296:
270:
269:
198:Institutions
177:
68:Pennsylvania
64:Philadelphia
57:May 21, 1981
18:
1595:1981 births
1525:December 1,
1480:December 1,
1457:December 1,
1422:December 1,
1418:. Melbourne
1395:December 1,
1349:December 1,
1299:(3): 50–7.
1277:1108.1791v3
1255:January 23,
1233:January 23,
1158:January 23,
1108:Elaine Rich
850:January 30,
566:time travel
79:Nationality
1589:Categories
1476:. Slashdot
1211:January 2,
841:"Quickies"
641:References
637:magazine.
547:Tibor RadĂł
459:ACM Fellow
53:1981-05-21
1343:ABC Radio
1090:April 14,
1031:March 18,
907:"OpenAI!"
809:April 12,
805:. mit.edu
778:March 28,
752:March 28,
727:March 28,
506:Holocaust
407:AI safety
327:Hong Kong
1321:18357822
1025:MIT News
615:Slashdot
536:academic
527:—
389:and the
362:calculus
83:American
1568:at the
1503:(2597).
1416:The Age
1390:4012018
1301:Bibcode
1184:June 9,
1110:(2008)
867:at the
605:The Age
510:Vitebsk
502:Shtetls
385:at the
245:Website
1546:Forbes
1388:
1319:
1114:
1009:. NSF.
995:. ACM.
887:. 2022
634:Forbes
568:, the
522:Talmud
413:Awards
403:OpenAI
381:After
377:Career
303:Jewish
184:Fields
158:PECASE
146:Awards
136:Spouse
1443:ZDNet
1386:JSTOR
1272:arXiv
1135:Qwiki
610:ZDNet
512:) as
451:2017
445:2009
439:2009
252:.blog
1527:2008
1482:2008
1459:2008
1447:CNET
1424:2008
1397:2008
1351:2008
1317:PMID
1257:2014
1235:2014
1213:2014
1186:2021
1160:2014
1112:ISBN
1092:2021
1083:2020
1069:2019
1033:2024
919:2022
893:2022
852:2018
811:2014
780:2023
754:2023
729:2023
687:2024
631:and
478:wiki
319:Asia
285:and
262:.com
43:Born
1378:doi
1374:156
1309:doi
1297:298
1106:by
258:www
1591::
1544:.
1518:.
1499:.
1445:.
1441:.
1414:.
1384:.
1372:.
1368:.
1341:.
1337:.
1315:.
1307:.
1295:.
1203:.
1177:.
1118:,
1023:.
934:,
909:.
883:.
843:.
827:CV
819:^
791:^
782:.
770:.
745:.
719:.
695:^
678:.
656:.
612:,
409:.
357:.
305:.
289:.
255:,
190:,
70:,
66:,
55:)
1529:.
1484:.
1461:.
1426:.
1399:.
1380::
1353:.
1323:.
1311::
1303::
1280:.
1274::
1259:.
1237:.
1215:.
1188:.
1162:.
1141:)
1035:.
921:.
895:.
854:.
813:.
756:.
731:.
689:.
629:,
623:,
617:,
607:,
601:,
422:.
51:(
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
