a. No; it works for both.





 

b. No; it works for both.





 

c. Yes; * YES!





 

d. No; it works for both.





 

a. No; we're talking about abstract machines here.





 

b. Yes; *YES!





 

c. No; we care deeply about this.





 

d. No; this matters a great deal.





 

a. No; True, but that's not why.





 

b. No; TM theory applies to all programs and languages.





 

c. No; True, but that's not why.





 

d. Yes; *YES!





 

a. Yes; *YES!





 

b. No; Nope.





 

c. No; Nope.





 

d. No;





 

a. No; No, they already do that.





 

b. No; True, but that's not the important result.





 

c. No; True, but that's not the important result.





 

d. Yes; *YES!





 

a. Yes; *YES!





 

b. No; it's unsolvable--ever!





 

c. No; it helps us determine what is computable.





 

d. No; both relate to unterminated behavior, but they are very different.





 

a. No; Nope.





 

b. Yes; *YES!





 

c. No; Nope.





 

d. No; Nope.





 

a. No; this is undecidable.





 

b. Yes; *YES!





 

c. No; this is undecidable.





 

d. No; this is undecidable.





 

a. No; these are undecidable based on theoretical issues.





 

b. Yes; *YES!





 

c. No;





 

d. No;





 

a. Yes; *YES!





 

b. No; Sorry, but it's true in a mathematical sense.





 

c. No;





 

d. No;