• @[email protected]
    link
    fedilink
    English
    86 months ago

    Scott Aaronson says that Aschenbrenner displays “unusual clarity, concreteness, and seriousness”.

    That’s it, that’s the joke

    • @[email protected]
      link
      fedilink
      English
      35 months ago

      You know for a blog that’s on its face about computational complexity, you’d think Scott would show a little more skepticism to the tech bro saying “all we need is 14 quintillion x compute to solve the Riemann hypothesis”