Scott Aaronson speaks for the computer scientists, partly in response to the same Times piece that I blogged about recently.
- Log in to post comments
Advertisment
Scott Aaronson speaks for the computer scientists, partly in response to the same Times piece that I blogged about recently.
I don't like his answers. He also says that the examples don't have the flavor of pure math, but they bloody do. They're not even new examples: Turing machines are from 1930s. Computational complexity was founded in the 70s.