Introduction to Cognitive Science - Old Questions

5. What do you understand by Turing machine? Design a Turing machine with finite set of states as q₀ and q₁, alphabets are 'a' and 'b', initial state is q₀ and assume 6 suitable transitions.