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 contributions is in formally defining what an algorithm is.

• #science_technology
• #church_turing
• #thesis
• #decidable
• #language