Alan Turing's Wonderful Machine
Offered By: Pluralsight
Course Description
Overview
A programmer's view of Alan Turing's ground breaking paper "On Computable Numbers with an Applications to the Entscheidungsproblem".
'On Computable Numbers...' lays out the foundation of what today we call the theory of computation. Turing points out that there are sequences of zeros and ones that no computer can generate. He also cracked one of the outstanding problems in formal logic at the time, the Endtscheidungsproblem, or decision problem. This course from the point of view of programmer, not a mathematician.
'On Computable Numbers...' lays out the foundation of what today we call the theory of computation. Turing points out that there are sequences of zeros and ones that no computer can generate. He also cracked one of the outstanding problems in formal logic at the time, the Endtscheidungsproblem, or decision problem. This course from the point of view of programmer, not a mathematician.
Syllabus
- On Computable Numbers... 26mins
- 1 ÷ 3 12mins
- Automatic Computing Machine 22mins
- States of Mind 16mins
- Universal Computing Machine 40mins
- Proofs 21mins
Taught by
Dan Sullivan
Related Courses
Automata TheoryStanford University via edX Theory of Computation
Massachusetts Institute of Technology via MIT OpenCourseWare Formal Language and Automata Theory- An Application in Compiler Design
Chhattisgarh Swami Vivekanand Technical University via Swayam Formal Language and Automata Theory- An Application in Compiler Design (औपचारिक भाषा और स्वचालित सिद्धांत: कंपाइलर डिज़ाइन में एक अनुप्रयोग)
IGNOU via Swayam Introduction to Automata, Languages and Computation
Indian Institute of Technology, Kharagpur via Swayam