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

83) Next move function δ of a Turing machine M = (Q, Σ ,Γ,δ, q0, B, F) is a mapping

84) If L can be recognized by a TM T with a doubly infinite tape, and τt = f, then L can be recognized by an ordinary TM with time complexity