Theory of Computing

a) To compute a function using a TM, the input arguments are

represented as _______ .

Give an example here for f(2,1): _________

And the output is also represented by ________.

b) If the language you have is recursive

then your TM acceptor is ___________________ but

If the language you have is recursively enumerable

then your TM acceptor is ___________________

c) If Super TM always halts on all input instances of a problem,

there is an ALGORITHM (i.e. DECIDABLE) for the problem.

1. Is this Decidable or Undecidable?

"Does a given Turing Machine M accept a given string W?" __________

2. What is the implication of this in terms of analyzing computer programs?

_________________________________________________________[2pts

please show work