Documents NP-complete Problems and Physical Reality Scott Aaronson UC Berkeley IAS.

Slide 1NP-complete Problems and Physical Reality Scott Aaronson UC Berkeley IAS Slide 2 Problem: Given a graph, is it connected? Each particular graph is an instance The…

Documents Quantum Computing and the Limits of the Efficiently Computable Scott Aaronson MIT.

Slide 1Quantum Computing and the Limits of the Efficiently Computable Scott Aaronson MIT Slide 2 Things we never see… Warp drive Perpetuum mobile GOLDBACH CONJECTURE: TRUE…

Documents Complexity. P=NP? Who knows? Who cares? Lets revisit some questions from last time – How many...

Slide 1Complexity Slide 2 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…

Documents Very Natural Computing Piotr Chrząstowski. Mimicking the nature Man always tried to learn from...

Slide 1 Very Natural Computing Piotr Chrząstowski Slide 2 Mimicking the nature Man always tried to learn from nature some fresh ideas. The nature rewarded man with many…