Quantum Computing and the Limits of the Efficiently Computable Scott Aaronson MIT.
NP-complete Problems and Physical Reality Scott Aaronson UC Berkeley IAS.
Complexity. P=NP? Who knows? Who cares? Lets revisit some questions from last time – How many pairwise comparisons do I need to do to check if a sequence.
Very Natural Computing Piotr Chrząstowski. Mimicking the nature Man always tried to learn from nature some fresh ideas. The nature rewarded man with many.
