Theory Of Computation MCQ

1:

If f : N--> N. If L can be recoognized by a TM T, so that τT(n) ≤ f (n) for all but finitely many n, then ( Time (f) means Time ( max ( f, 2n +2))). 

A.

L  ∈Time (f)

B.

L  ∈  Time(cf)

C.

L  ∈ Time (h)

D.

none of these

 

Answer : A

Explanation :

Write your comments here:


Report Error
 

Option: A

Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here.