u/draconisin r/compsci • Recommends
#pvsnp#computationalcomplexity#turingmachine
Beyond Computation: The P vs NP Problem - Michael Sipser
14K subscribers • 1 video on Hallway
- Recommended by 1 person: 1 in engineering communities.
- Presented by Michael Sipser, Professor of Applied Mathematics at MIT
Intermediate. Assumes working knowledge.
170K views14 years ago1 recommendation
Computer scienceComputation and complexityAlgorithms
Michael Sipser explains the history, significance, and mathematical foundations of the P vs NP problem.
Beyond Computation: The P vs NP Problem Michael Sipser, MIT Tuesday, October 3, 2006 at 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. claymath.org/public_lectures/sipser_poster.jpg claymath.org/public_lectures/sipser1.phpWhy it's here
1 person recommends thisWhat people say. Recommended as an excellent public lecture explaining the P vs NP problem.
u/umib0zuin r/compsci • Mentions
On “Computer Science related movies”
u/Audacein r/compsci • Mentions
On “P vs NP for beginners?”
u/FuschiaKnightin r/compsci • Mentions
On “What is NP-Hard?”
u/umib0zuin r/compsci • Mentions
On “What's the best computer science paper, you've ever read?”
u/FuschiaKnightin r/compsci • Mentions
On “Interview on Wednesday, and am a little nervous!”