Abstract
Let U ( n ) be a monotone increasing function which is real-time computable, {if442-1}. Then it is possible to describe a set of words A U such that (1) A U is recognizable within the time bound T ( n ) = C 1 . U ( n ), for suitable {itC 1 }; (2) If M is an on-line Turing machine which recognizes the set of words A U , then τ M ( n ) > C M .U} ( n ) for infinitely many values of n , where C M is a constant depending on the machine M (on the number of its tapes and on the number of tape symbols) and τ M ( n ) is the minimum computational time needed by M to recognize any word of length n . Hence if lim n →∞} T ( n )/ U ( n ) = 0 (for T ( n ), U ( n ) monotone increasing functions, U ( n ) real time computable, {if442-2} then the set of words A U is recognizable within the time bound U ( n ) but it is not recognizable within the time bound T ( n ).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
