QUESTION 4

a. A Turing machine can run another Turing machine on an input.

True

False

b. Suppose there is a language A. Assume that there is no Turing machine M such that w A if and only if M accepts w. However, there exists a Turing machine N such that for every string w A, N accepts w. What type of the language A?

	a.	A is a recognizable language but not decidable.
	b.	A is a decidable language but not a recognizable language.
	c.	A is not a recognizable language.
	d.	A is a decidable language.