SPEED—UP THEOREM AND HIERARCHY OF THE RECURSIVE FUNCTIONS
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    In this paper , we ll introduce a kind of O(F)-LOOP operator , which will lead to a hierarchy of any recursive functions:O(F)=O(F)n. We've proved that this hierarchy, corresponds to the speed-up theorem , i. e. given any r(x)∈O(F)i, there is a language having O(F)i+1 complexity which can be speeded up by r(x), and also there is a r(x) in O(F)i, so that any language having O(F)i complexity cannot be speeded up by r(x) . Through this, we can grasp the soul of Speed-up theorem in a more higher level.

    Reference
    Related
    Cited by
Get Citation

徐书润,王永革.加速定理与函数分层.软件学报,1993,4(4):38-43

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:December 01,1990
  • Revised:May 23,1991
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063