Theory of Computation Quiz3 Review

最后一次quiz了，最近真的很累，复习一下

1. Using halting problem to show other problems undecidable

• definition of decidable, undecidable

  
  
  

  image.png

• halting problem and its proof

  
  
  image.png
  
  
  image.png
  
  
  

  image.png

• practice questions

  
  
  

  image.png
  
  
  

  image.png

2. Proving a set A is r.e.

• prove there exists a TM can list A.

• example questions:

  
  
  

  image.png

image.png

3. TM simulating a Random Access Machine