L11: Church-Turing Thesis and Examples of Decidable Languages
Church-Turing thesis; examples of decidable languages. An algorithm is defined by the existence of a TM that implements the algorithm. One of Turing's great ...
UC Davis
23.6K views • Dec 13, 2012
About this video
Church-Turing thesis; examples of decidable languages. An algorithm is defined by the existence of a TM that implements the algorithm. One of Turing's great contributions is in formally defining what an algorithm is.
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
23.6K
Likes
187
Duration
01:18:05
Published
Dec 13, 2012
User Reviews
4.2
(4) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.