Turing Machines & Computability: Uncountable Sets, Diagonalization & Undecidable Problems 📚
Explore key concepts in computability theory, including cardinality, uncountable sets, diagonalization, and undecidable decision problems in Lecture 6e for McMaster University's undergraduate course.
William Farmer
515 views • Apr 1, 2021
About this video
Keywords: cardinality, uncountable sets, diagonalization, undecidable decision problems.
Lecture 6e for McMaster University undergraduate course COMPSCI/SFWRENG 2FA3 (Discrete Mathematics with Applications II) Winter 2021.
Lecture 6e for McMaster University undergraduate course COMPSCI/SFWRENG 2FA3 (Discrete Mathematics with Applications II) Winter 2021.
Video Information
Views
515
Likes
4
Duration
17:10
Published
Apr 1, 2021
Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.