Hacker News
- Who Can Name the Bigger Number? https://www.scottaaronson.com/writings/bignumbers.html 9 comments
- A query complexity breakthrough http://www.scottaaronson.com/blog/?p=2325 15 comments
- How can we fight online shaming campaigns? http://www.scottaaronson.com/blog/?p=2221 33 comments
- Why I Am Not An Integrated Information Theorist (or, The Unconscious Expander) http://www.scottaaronson.com/blog/?p=1799 22 comments
- New straighforward approach to teaching quantum mechanics http://www.scottaaronson.com/democritus/lec9.html 55 comments
Lobsters
- My 116-page survey article on P vs. NP: better late than never http://www.scottaaronson.com/blog/?p=3095 2 comments compsci
- Why Philosophers Should Care About Computational Complexity http://www.scottaaronson.com/papers/philos.pdf 2 comments compsci , pdf , philosophy
- The Computational Expressiveness of a Model Train Set https://www.scottaaronson.com/blog/?p=5402 4 comments compsci
- The Busy Beaver Frontier (Scott Aaronson's surveys the Busy Beaver function). https://www.scottaaronson.com/papers/bb.pdf 23 comments math
- Incompleteness Ex Machina [pdf]: "Godel's work, rightly viewed, needs to be split into two parts: the transport of computation into the arena of arithmetic on the one hand and the actual incompleteness theorems on the other." https://www.scottaaronson.com/incompleteness.pdf 14 comments compsci
- Shtetl-Optimized » Blog Archive » The 8000th Busy Beaver number eludes ZF set theory https://www.scottaaronson.com/blog/?p=2725 27 comments math
- Can computers become conscious? A reply to Roger Penrose http://www.scottaaronson.com/blog/?p=2756 124 comments philosophy
- The 8000th Busy Beaver number eludes ZF set theory: new paper by Adam Yedidia and Scott Aaronson http://www.scottaaronson.com/blog/?p=2725 77 comments math
- The 8000th Busy Beaver number eludes ZF set theory http://www.scottaaronson.com/blog/?p=2725 27 comments compsci
- “Largely just men doing sums”: My review of the excellent Ramanujan film / Aaronson shtetl optimized blog http://www.scottaaronson.com/blog/?p=2707 14 comments math
- Shtetl-Optimized - Google, D-Wave, and the case of the factor-10^8 speedup for WHAT? - a very interesting analysis of the recent quantum computing results of Google Quantum lab http://www.scottaaronson.com/blog/?p=2555 9 comments hardware
- Google, D-Wave, and the case of the factor-10^8 speedup for WHAT? http://www.scottaaronson.com/blog/?p=2555 23 comments programming
- Google, D-Wave, and the case of the factor-10^8 speedup for WHAT? http://www.scottaaronson.com/blog/?p=2555 33 comments compsci
- Why Philosophers Should Care About Computational Complexity http://www.scottaaronson.com/papers/philos.pdf 2 comments programming
- Eight Signs A Claimed P≠NP Proof Is Wrong http://www.scottaaronson.com/blog/?p=458&print=yes 16 comments math
- Scott Aaronson's Conversation with “Eugene Goostman,” the Chatbot that’s All Over the News for Allegedly Passing the Turing Test http://www.scottaaronson.com/blog/?p=1858 13 comments artificial
- The Scientific Case for P≠NP (by Scott Aaronson) http://www.scottaaronson.com/blog/?p=1720 78 comments compsci
- Why Philosophers Should Care About Computational Complexity- Scott Aaronson http://www.scottaaronson.com/papers/philos.pdf 6 comments philosophy
- What happens when an unstoppable PR force hits an NP-hard problem? The answer’s getting clearer http://www.scottaaronson.com/blog/?p=1643 5 comments science
- 10 reasons to believe P!= NP http://www.scottaaronson.com/blog/?p=122 72 comments programming
- 10 reasons to believe that P != NP http://www.scottaaronson.com/blog/?p=122 52 comments compsci
- NSA: Possibly breaking US laws, but still bound by laws of computational complexity http://www.scottaaronson.com/blog/?p=1517 5 comments programming
- "If P=NP, then people could design more effective cancer therapies, solve more crimes, and better predict which baseball games would be closely-matched and exciting (yes, really)." -Scott Aaronson, MIT http://www.scottaaronson.com/blog/?p=1293 102 comments compsci
- Vector spaces and "entanglement" http://www.scottaaronson.com/democritus/lec9.html 12 comments math
- Polynomial hierarchy collapses: thousands feared tractable. http://www.scottaaronson.com/writings/phcollapse.pdf 49 comments compsci
- 2.373 http://www.scottaaronson.com/blog/?p=839 63 comments math
- Scott Aaronson: "Why Philosophers Should Care About Computational Complexity" http://www.scottaaronson.com/blog/?p=735 30 comments programming
- Evidence that humans can solve arbitrary problems from P in their head (using recognition memory) http://www.scottaaronson.com/blog/?p=728 15 comments compsci
- A short story by M.I.T. faculty member Scott Aaronson about a woman whose rationality got in the way of her happiness. http://www.scottaaronson.com/writings/selfdelusion.html 12 comments philosophy
- Who Can Name the Bigger Number? (repost, but interesting) http://www.scottaaronson.com/writings/bignumbers.html? 69 comments math
- So if Bayes' Theorem seems unobjectionable, then I want to make you feel queasy about it. http://www.scottaaronson.com/democritus/lec17.html 11 comments science
- Who Can Name the Bigger Number? http://www.scottaaronson.com/writings/bignumbers.html 13 comments math
- Is P vs NP formally independent? [PDF] http://www.scottaaronson.com/papers/pnp.pdf 53 comments programming
- One Short, Brilliant Lecture: Covers Entire Grad Level Set Theory Course http://www.scottaaronson.com/democritus/lec2.html 2 comments reddit.com
- Quantum mechanics made simple (for math and cs people) http://www.scottaaronson.com/democritus/lec9.html 88 comments science