Chapter 3: The Church-Turing Thesis

For Your Enjoyment

• A Turing Machine Simulator

Chapter 3.1, Turing Machines

Consider Language A = {0^{2^n} | n ≥ 0}

• Understand the English algorithm on page 171.
• Understand the state diagram on page 172.
• Show the configurations for input 00.
• Active Learning: Show the configurations for input 0.
• Active Learning: Show the configurations for input 000.

Consider Language B = {w#w | w ∈ {0,1}^*}

• Understand the state diagram on page 173.
• Active Learning: Show the configurations for input 01#01.
• Active Learning: Show the configurations for input 00#01.

In-Class Notes