P vs NP on TV - Computerphile
Audible free book & trial at: http://www.audible.com/computerphile
Our thanks to them.
P vs NP in The Simpsons and Futurama. Featuring author Simon Singh.
http://simonsingh.net
Simon on Numberphile: http://bit.ly/SimonSinghPlay
Clarification: NP actually stands for non-deterministic (or nondeterministic) polynomial. Simon did us a favour by speaking off-the-cuff on this topic and it is our fault for not cleaning up things in the edit. However Simon's (excellent) book covers this in more detail (pages 157-159 in hard cover) and, in it, he opts for nondeterministic without the hyphen.
http://www.facebook.com/computerphile
https://twitter.com/computer_phile
Film by Sean Riley and Brady Haran.
See the full list of Brady's video projects at: http://bit.ly/bradychannels
Видео P vs NP on TV - Computerphile канала Computerphile
Our thanks to them.
P vs NP in The Simpsons and Futurama. Featuring author Simon Singh.
http://simonsingh.net
Simon on Numberphile: http://bit.ly/SimonSinghPlay
Clarification: NP actually stands for non-deterministic (or nondeterministic) polynomial. Simon did us a favour by speaking off-the-cuff on this topic and it is our fault for not cleaning up things in the edit. However Simon's (excellent) book covers this in more detail (pages 157-159 in hard cover) and, in it, he opts for nondeterministic without the hyphen.
http://www.facebook.com/computerphile
https://twitter.com/computer_phile
Film by Sean Riley and Brady Haran.
See the full list of Brady's video projects at: http://bit.ly/bradychannels
Видео P vs NP on TV - Computerphile канала Computerphile
Показать
Комментарии отсутствуют
Информация о видео
Другие видео канала
P vs. NP - The Biggest Unsolved Problem in Computer ScienceThe Simpsons and Their Mathematical Secrets | Simon Singh | Talks at GoogleGödel's Incompleteness Theorem - NumberphileThe Bridges to Fermat's Last Theorem - NumberphileThe Most Difficult Program to Compute? - ComputerphileP vs. NP and the Computational Complexity ZooThe Feigenbaum Constant (4.669) - NumberphileDonald Knuth: P=NP | AI Podcast ClipsBeyond Computation: The P vs NP Problem - Michael SipserFloating Point Numbers - ComputerphileWhat Computers Can't Do - with Kevin BuzzardFermat's Last Theorem - Numberphile16. Complexity: P, NP, NP-completeness, ReductionsProgramming Loops vs Recursion - ComputerphileVon Neumann Architecture - ComputerphileTranscendental Numbers - NumberphileWhy is P vs NP Important?Turing's Enigma Problem (Part 1) - ComputerphileThe Key to the Riemann Hypothesis - NumberphileThe Great 202 Jailbreak - Computerphile