78) The statement, “A TM can’t solve halting problem” is

79) If there exists a TM which when applied to any problem in the class, terminates, if correct answer is yes and may or may not terminate otherwise is called

80) Given a Turing machine T and a step-counting function f, is the language accepted by T in Time(f) ? This decision problem is

81) A total recursive function is a

82) The running time T (n), where 'n' is input size of a recursive algorithm, is given as
T (n) = c + T (n - 1), if n > 1
= d, if n ≤1
The order of the algorithm is