Scott Aaronson’s work in computational complexity
A really fun paper by Scott Aaronson, part of which considers the physical implications of P != NP.
-
Subscribe
Subscribed
Already have a WordPress.com account? Log in now.
reperiendi 
leave a comment