A function f is called __________ if there exists a TM T so that for any n and any input string of length n, T halts in exactly f(n) moves.
(a) Step function
(b) Step counting function
(c) Inplace functions
(d) None of the mentioned
I had been asked this question in an online interview.
Question is taken from Class RP and ZPP,Complexity in division Other Classes Of Problems of Automata Theory