I'm reading Scott Aaronson's free online book about P vs. NP, and it is *great*: http://www.scottaaronson.com/papers/pnp.pdf (via @michael_nielsen @flantz)
Scott Aaronson's short book on P vs NP: http://www.scottaaronson.com/papers/pnp.pdf I've only skimmed, but it looks great!
-
-
-
Aaronson is one of the best writers on mathematics I know -- deft at describing complex stuff in a way I, non-mathematician, can grasp.
End of conversation
New conversation -
-
-
Should be easy to validate whether it's good.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
I also really enjoyed Why Philosophers Should Care About Computational Complexity: http://scottaaronson.com/papers/philos.pdf …
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
Years ago, Scott's fantastic blog motivated me to study TCS as a hobby. Now, I find this P=?NP survey very approachable!
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
Yeah, same here. I wish I had gone further and deeper with it educationally.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.