Introduction to Cognitive Science - Old Questions

5. Design a Turing machine with finite set of states as q₀ and q₁, alphabets are 'a', 'b' and 'c', initial state is q₀ and assume 5 suitable transitions. What are the practical applications of Turing machine?