It might as well be my own hand on the madman’s lever—and yet, while I grieve for all innocents, my soul is at peace, insofar as it’s ever been at peace about anything.

Psychopath.

  • blakestacey@awful.systemsM
    link
    fedilink
    English
    arrow-up
    9
    ·
    11 days ago

    I suppose one prominent thing is his book, Quantum Computing Since Democritus. I know of various other books about quantum information/computing, written from a physicist perspective. There are David Mermin’s Quantum Computer Science: An Introduction (Cambridge UP, 2007) and Eleanor Rieffel and Wolfgang Polak’s Quantum Computing: A Gentle Introduction (MIT Press, 2014). If anyone knows a decent undergrad introduction to Gödel incompleteness and its relation to the halting problem, that would probably cover a lot of the rest, apart from what I recall as rather shallow pseudophilosophical faffling. (I am going off decade-old memories and the table of contents here.)

    • blakestacey@awful.systemsM
      link
      fedilink
      English
      arrow-up
      4
      ·
      4 days ago

      I borrowed a copy of Quantum Computing Since Democritus and read a bit of it. As can happen in books based directly on lectures, it has more “personality” overtly on display than the average technical book. That goes for good and for ill. What Alice finds engaging, Bob can find grating, and vice versa. In this case, I noticed some passages that sound, well, smarmy. I personally can’t help but read them through the lens of everything that’s happened since, and all the ways that Aaronson has told the world what kind of person he is. Through that lens, there’s a kind of self-deprecating arrogance on display, as though the book is saying, “I am a nerd, I hold the one true nerd opinion, and everything I assert is evident and simple if you are a nerd, which again, I am the defining example of.” It’s possible that I would have skipped past all that a decade ago, but now, I can’t not see it.

      There are big chunks of it that I’m not the best reader to evaluate. I’m a physicist who has casually studied computer science along with many other interests; I haven’t tried to teach P vs NP in a classroom setting. But where the book does overlap with more serious interests of mine, I found it wanting. There’s a part (chapter 9) about exploring where the rules of quantum theory could come from, and how the mathematics of the theory could potentially be derived from more basic premises rather than taken as postulates. I found this discussion badly organized and poorly argued. In 2013, it was historically shallow, and now in 2025, it’s outdated.

      Everything he says about Bohr is caricatured to the point of absurdity.

      His history of the halting problem is conventional but wrong.

      The last chapter is called “Ask me anything” and records a Q&A he held on the last day of the course upon which the book was based. It gets onto the topic of evolution, veers into naive adaptationism and blends that with social Darwinism… yeaahhhh.

    • corbin@awful.systems
      link
      fedilink
      English
      arrow-up
      7
      ·
      11 days ago

      Gödel makes everyone weep. For tears of joy, my top pick is still Doug Hofstadter’s Gödel, Escher, Bach, which is suitable for undergraduates. Another strong classic is Raymond Smullyan’s To Mock a Mockingbird. Both of these dead-trees are worth it; I personally find myself cracking them open regularly for citations, quotes, and insights. For tears of frustration, the best way to fully understand the numerical machinery is Peter Smith’s An Introduction to Gödel’s Theorems, freely available online. These books are still receiving new editions, but any edition should suffice. If the goal is merely to ensure that the student can diagonalize, then the student can directly read Bill Lawvere’s 1968 paper Diagonal arguments & Cartesian closed categories with undergraduate category theory, but in any case they should also read Noson Yanofsky’s 2003 expository paper A universal approach to self-referential paradoxes, incompleteness & fixed points. The easiest options are at the beginning of the paragraph and the hardest ones are at the end; nonetheless any option will cover Cantor, Russell, Gödel, Turing, Tarski, and the essentials of diagonalization.

      I don’t know what to do about stuff like the Complexity Zoo. Their veterinarian is Greg Kuberberg, a decent guy who draws lots of diagrams. I took some photos myself when I last visited. But obviously it’s not an ideal situation for the best-known encyclopedia to be run by Aaronson and Habryka.

        • Soyweiser@awful.systems
          link
          fedilink
          English
          arrow-up
          5
          ·
          edit-2
          11 days ago

          They don’t even try to catch the page spammers? Ow god. (the account creation is hard to do something about, but the page spammers is just bad, in this case it is also bad because all the new accounts end with 4 numbers). Less than the bare minimum.

          (how are the very online, worried about robots killing everybody, have enough time to write book sized blogposts, so bad at this, when I was active trying to maintain a wiki I checked the recent changes somewhat regularly, for shame).

          Give me admin rights Scott, I can keep the toxic elements off my your wiki.

          • blakestacey@awful.systemsM
            link
            fedilink
            English
            arrow-up
            4
            ·
            10 days ago

            The very unscientific sampling I did just now suggests that those complexity classes which Wikipedia covers, it covers better than the Zoo does anything. Of course, the Zoo has room for #P/lowpoly and LOGWANK and all the other classes that are attested in one paper apiece.

            • Soyweiser@awful.systems
              link
              fedilink
              English
              arrow-up
              4
              ·
              10 days ago

              See so the wiki should link, or even cache/include the oages from wikipedia that are better easy to do in mediawiki.

              Make me an admin Scott, I know mediawiki, and I can be trusted. Honest.

                • Soyweiser@awful.systems
                  link
                  fedilink
                  English
                  arrow-up
                  2
                  ·
                  9 days ago

                  Yeah sadly my knowledge of recent research on complexity classes is almost non-existent and before that I was not the greatest at it in university.

                • corbin@awful.systems
                  link
                  fedilink
                  English
                  arrow-up
                  2
                  ·
                  9 days ago

                  Sometimes the required writing style for nLab is a little restrictive. It’s not a good place to dump a bunch of info. Kind of opposite that, I also beefed up the esolangs list of complexity classes a while ago; it’s limited in scope and audience too, but folks usually find that style more accessible.

                  I’m so jealous that you started the page for 24! I’ve only worked on niche topics and meanwhile you’ve got the most important numerology in all of combinatorics. I still need to rewrite that Jim Carrey movie 23 to be about 24; it’s on my list.