!!Con 2018: If you could solve this word tile puzzle, you could... by Kamal Marhubi
If you could solve this word tile puzzle, you could solve the halting problem! (Too bad you can’t!) by Kamal Marhubi
The idea that there are undecidable problems – ones that simply cannot be solved with computers – is kind of mind-blowing. The most well-known is the halting problem: given a Turing machine (program), will it halt (terminate)? Many other undecidable problems are either very similar to the halting problem, or very abstract. In this talk I’ll show one that is neither! The Post Correspondence Problem is a word tile puzzle that is actually undecidable. I’ll walk through how to prove this, by building a special puzzle that has a solution if and only if a Turing machine would halt. At the end, I hope you’ll share some of my wonder at the theoretical side of computers!
Other Videos By Confreaks
Other Statistics
Tiles Statistics For Confreaks
There are 286 views in 1 video for Tiles. His channel published less than an hour of Tiles content, making up less than 0.01% of the total overall content on Confreaks's YouTube channel.