Beyond Computation: The P vs NP Problem - Michael Sipser
Beyond Computation: The P vs NP Problem
Michael Sipser, MIT
Tuesday, October 3, 2006 at 7:00 PM
Harvard University Science Center — Hall B
One Oxford Street, Cambridge, MA, 02138
In a remarkable 1956 letter, the great logician Kurt Gödel asked the famous mathematician and computer pioneer John von Neumann whether certain computational problems could be solved without resorting to brute force search.
http://www.claymath.org/public_lectures/sipser_poster.jpg
http://www.claymath.org/public_lectures/sipser1.php
Видео Beyond Computation: The P vs NP Problem - Michael Sipser канала PoincareDuality
Michael Sipser, MIT
Tuesday, October 3, 2006 at 7:00 PM
Harvard University Science Center — Hall B
One Oxford Street, Cambridge, MA, 02138
In a remarkable 1956 letter, the great logician Kurt Gödel asked the famous mathematician and computer pioneer John von Neumann whether certain computational problems could be solved without resorting to brute force search.
http://www.claymath.org/public_lectures/sipser_poster.jpg
http://www.claymath.org/public_lectures/sipser1.php
Видео Beyond Computation: The P vs NP Problem - Michael Sipser канала PoincareDuality
Показать
Комментарии отсутствуют
Информация о видео
Другие видео канала
P vs. NP and the Computational Complexity ZooBeyond Computation: The P versus NP question (panel discussion)Benford's Very Strange Law - Professor John D. BarrowCook explains why P=NP matters.Outlander - Beyond Computation [1994]The Extraordinary Theorems of John Nash - with Cédric VillaniKomplexität #03 - P, NP und ExpTimeProfessor Avi Wigderson on the "P vs. NP" problem16. Complexity: P, NP, NP-completeness, ReductionsV.O. Complete. 21st Century Mathematics is pure creativity. Keith Devlin, mathematicianWhat Computers Can't Do - with Kevin BuzzardP vs NP on TV - ComputerphileWhat is complexity theory? (P vs. NP explained visually)What is a Manifold? - Mikhail GromovEveraise Academy Guest Lecture - "P vs NP" by Professor Michael SipserP vs. NP - The Biggest Unsolved Problem in Computer ScienceDonald Knuth: P=NP | AI Podcast ClipsR8. NP-Complete ProblemsSean Carroll - The Particle at the End of the UniverseWhy Everything You Thought You Knew About Quantum Physics is Different - with Philip Ball