Undecidability & Unrecognizability via Reduction 📚
Example 8 demonstrating undecidability and unrecognizability through reduction in CS Theory lecture 10.
Tim Randolph
1.2K views • Jun 23, 2022
About this video
This is Example 8: Showing Undecidability and Unrecognizability via Reduction, a companion video for lecture 10 of COMS W3261: Computer Science Theory at Columbia University. This isn't a standalone video - it's designed to complement the course content.
0:00 Intro
1:00 Example 1
4:56 Example 2
Course website: https://twrand.github.io/3261-sum22.html
Video notes: https://twrand.github.io/pdfs/notability/COMSW3261_sum22_Ex8.pdf
0:00 Intro
1:00 Example 1
4:56 Example 2
Course website: https://twrand.github.io/3261-sum22.html
Video notes: https://twrand.github.io/pdfs/notability/COMSW3261_sum22_Ex8.pdf
Video Information
Views
1.2K
Likes
16
Duration
9:52
Published
Jun 23, 2022
User Reviews
4.4
(1)