Turing machines Q8

0. 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))). 

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *