• DEFINITIONS
• TURING MACHINE
  • Instantaneous Description Of M
• TURING MACHINES AS LANGUAGE ACCEPTORS
  • 
  • 
  • 
• LANGUAGE OF M
• Computable Languages
• TURING MACHINES AS TRANSDUCERS
  • 1. TM for x + y
  • 2. TM For Duplication
  • 3. TM For Comparison
  • 4. TM To Multiply
    • Practice Questions
• TM AS A COMPUTER OF INTEGER FUNCTIONS
• POST'S CORRESPONDENCE PROBLEM
• About this document ...