HW#4 --- last modified March 02 2019 21:29:09..
Solution set.
Due date: Apr 19
Files to be submitted:
Hw4.tex
Purpose: To learn how to recognize when a machine model is of the same strength
as a Turing Machine, to learn the closure properties of Turing recognizable languages, to learn which
problems about our machine models are decidable.
Specification:
Do problems 3.9, 3.11, 3.15, 4.2, 4.12, 4.27 out of Sipser and write up your solution in LaTeX as Hw4.tex.
Point Breakdown
| LaTeX file compiles |
1pt
|
| Problems from the book (1.5pts each) |
9pts
|
| Total | 10pts |
|