From the book, Chapter 17:
1a.
From the book, Chapter 19:
1a,b.
From the book, Chapter 20:
3, 4, 6b.
You can assume, for the problems in Chapter 20, that there is at least one undecidable language, H in Sigma*.
In addition, give a TM program that takes as input two strings (interpreted as numbers) and outputs the sum of those numbers. You may use JFLAP or another TM simulator.
To submit: A high-level description of your TM, including the format for your inputs (how they appear on the tape(s)) and output, and how the addition is done, plus the actual TM in the form of a table or diagram.