Topic: Discrete Mathematics and its Applications" Chapter 13 Modeling Computation:Turing Machines

3. Variation on 13.5#13]. Construct a Turing machine that recognizes the set of all bit strings that contain an odd number of 1s. Variation on 13.5#21]. Construct a Turing machine that computes the func- tion f(n) = 2 if n 6 and f(n) = 0 if n = 0, 1, 2, 3, 4, or 5. 4