Sipser: Chapter 4
From CSWiki
Contents |
[edit]
Decidability
Sipser uses Turing machines to show that some languages are decidable and some are not. Since Turing machine is the universal model of computation, this chapter gives us ideas of what is computable and what is not.
[edit]
Sections
[edit]
Selected solutions
Exercises 4.1, 4.5(a), and 4.5(d) and Problems 4.9, 4.11, 4.13, 4.21, and 4.23 only, please!
[edit]
