Impossible Programs (The Halting Problem)
Some programming problems are so hard that they’re impossible. We look at the first problem to have been proved undecidable, the halting problem, which was instrumental in forming the basis of the modern computer.
Created by: Cory Chang
Produced by: Vivian Liu
Script Editors: Justin Chen, Brandon Chen, Elaine Chang, Zachary Greenberg
The Halting Problem: https://en.wikipedia.org/wiki/Halting_problem
Entscheidungsproblem: https://en.wikipedia.org/wiki/Entscheidungsproblem
Turing Machine: https://en.wikipedia.org/wiki/Turing_machine
Church-Turing Thesis: https://en.wikipedia.org/wiki/Church–Turing_thesis
Turing’s Paper, About: http://www.philocomp.net/home/turing.htm
Turing’s Paper, Original: https://www.cs.virginia.edu/~robins/Turing_Paper_1936.pdf
---
Twitter: https://twitter.com/UBehavior
Видео Impossible Programs (The Halting Problem) канала Undefined Behavior
Created by: Cory Chang
Produced by: Vivian Liu
Script Editors: Justin Chen, Brandon Chen, Elaine Chang, Zachary Greenberg
The Halting Problem: https://en.wikipedia.org/wiki/Halting_problem
Entscheidungsproblem: https://en.wikipedia.org/wiki/Entscheidungsproblem
Turing Machine: https://en.wikipedia.org/wiki/Turing_machine
Church-Turing Thesis: https://en.wikipedia.org/wiki/Church–Turing_thesis
Turing’s Paper, About: http://www.philocomp.net/home/turing.htm
Turing’s Paper, Original: https://www.cs.virginia.edu/~robins/Turing_Paper_1936.pdf
---
Twitter: https://twitter.com/UBehavior
Видео Impossible Programs (The Halting Problem) канала Undefined Behavior
Показать
Комментарии отсутствуют
Информация о видео
Другие видео канала
The Halting Problem - An Impossible Problem to SolveAlan Turing - Giants of Computer ScienceSome Infinities ARE Bigger Than Other Infinities (Diagonalization)Math's Existential Crisis (Gödel's Incompleteness Theorems)Proof That Computers Can't Do Everything (The Halting Problem)Is Democracy Impossible? (Arrow's Theorem)Halting Problem in Python - ComputerphileGödel's First Incompleteness Theorem, Proof SketchTuring & The Halting Problem - ComputerphileAre There Problems That Computers Can't Solve?P vs. NP and the Computational Complexity ZooWhat Makes Mario NP-Hard? (Polynomial Reductions)The Halting Problem: The Unsolvable ProblemHow to Compare InfinitiesP vs. NP - An IntroductionWhat Makes P vs. NP So Hard? (P ≠ EXPTIME, Time Hierarchy, Baker-Gill-Solovay)Navier-Stokes Equations - NumberphileGödel's Incompleteness Theorem - NumberphileHalting Problem & Quantum Entanglement 2020 Breakthrough result [MIP*=RE]What Is Big O? (Comparing Algorithms)