reperiendi

Scott Aaronson’s work in computational complexity

Posted in Uncategorized by Mike Stay on 2009 November 30

A really fun paper by Scott Aaronson, part of which considers the physical implications of P != NP.

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: