Deciphering Computable Numbers & the Entscheidungsproblem 🔍
Explore Melvin Zhang's in-depth analysis of computable numbers and their role in solving the Entscheidungsproblem, based on Turing's groundbreaking 1936 paper. Join us for insights into foundational questions of computability and decision algorithms.
Engineers.SG
4.8K views • Jul 20, 2015
About this video
Speaker: Melvin Zhang
Paper: http://www.cs.virginia.edu/~robins/Turing_Paper_1936.pdf
Event Page: https://www.facebook.com/events/668655799934960/
Produced by Engineers.SG
Help us caption & translate this video!
http://amara.org/v/WChK/
Paper: http://www.cs.virginia.edu/~robins/Turing_Paper_1936.pdf
Event Page: https://www.facebook.com/events/668655799934960/
Produced by Engineers.SG
Help us caption & translate this video!
http://amara.org/v/WChK/
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
4.8K
Likes
57
Duration
42:08
Published
Jul 20, 2015
User Reviews
4.4
(4) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.
Trending Now