Start learning today with SkillShare: [ Ссылка ]
Alan Turing proved that the Halting Problem was impossible for Turing machines (computers) to solve. Come find out how.
The quantum computer game I talked about: [ Ссылка ]
This video was co-written by my super smart hubby Simon Mackenzie.
Hi! I'm Jade. Subscribe to Up and Atom for new physics, math and computer science videos every two weeks!
*SUBSCRIBE TO UP AND ATOM* [ Ссылка ]
Visit the Up and Atom Store
[ Ссылка ]
*Follow me: @upndatom
TWITTER: [ Ссылка ]
INSTAGRAM: [ Ссылка ]
Check out this PlayList for a taste of the channel:
[ Ссылка ]
A big thank you to my AMAZING PATRONS!
Paul Kendra, Harsh Tank, Alan McNea, Daniel Tan-Holmes, Simon Mackenzie, Yoseph, Andrew Pann, Dave, Anne Tan, Ayan Doss, Marc Watkins, Sung-Ho Lee, Todd Loreman, David, Susan Jones, M.H. Beals, Doug Cowles, Stephen Veitch, Renato Pereira, Simon Dargaville, Dean Madden, Noah McCann, Robert Frieske, Magesh.
If you'd like to consider supporting Up and Atom, head over to my Patreon page :)
[ Ссылка ]
For a one time donation, head over to my PayPal :)
[ Ссылка ]
Other videos you might like:
What is the Schrödinger Equation, Exactly? [ Ссылка ]
What is a Singularity, Exactly? [ Ссылка ]
Y CN U R34D DIS? [ Ссылка ]
*Sources*
[ Ссылка ]
[ Ссылка ].pdf
[ Ссылка ]
*Music*
[ Ссылка ]
The Halting Problem - An Impossible Problem to Solve
Теги
halting problemthe halting problemcomputer scienceuniversity of nottinghamhalting problem explainedthe halting problem of turing machinehalting problem proofturing halting problemup and atomturing testturing machinealan turingturing halting theoremturing halting problem videowhat is the halting problemtheory of computationturing problemhalt machinegoldbach conjecturefixproof by contradictionturingcomputerphilecomputerslogic