, On effective procedures for speeding up algorithms, Journal of the Association for Computing Machinery 18, 2 (April 1971), 290--305.  Home/Search   Document Not in Database   Summary   Related Articles

....F 0 (defined by F 0 (f) x) F (f) x) jxj, for example) so that F 0 (S 0 ) S would imply F (S 0 ) S a.e. On the other hand, if we weaken our requirement to infinitely often (i.o. speedup, then we can arrange for the amount of speedup to be even more drastic. Leveling Theorem [Bl71]. For each computable total function f : Sigma N, there is a computable predicate P : Sigma f0; 1g not computable within space f , but with i.o. speedup to triviality , in the following sense: Whenever P is computable within a space bound S, it is also computable within a space ....

, On effective procedures for speeding up algorithms, Journal of the Association for Computing Machinery 18, 2 (April 1971), 290--305.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC