ORDINAL COMPLEXITY OF RECURSIVE DEFINITIONS

被引：7

作者：

FAIRTLOUGH, MVH

WAINER, SS

机构：

[1] Department of Pure Mathematics, Leeds University, Leeds

来源：

INFORMATION AND COMPUTATION | 1992年 / 99卷 / 02期

关键词：

D O I：

10.1016/0890-5401(92)90027-D

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We classify and compare recursive and iterative definitions of total computable functions according to the complexity of the ordinal structures needed to verify termination. An old theorem of Tait is generalised to show that the cost of transforming recursive programs into while-loops is at most an exponential increase in the length of their termination orderings. © 1992.

引用

页码：123 / 153

页数：31

共 50 条

[1] Ordinal recursive complexity of lossy channel systems
Chambart, P.
Schnoebelen, Ph.
[J]. TWENTY-THIRD ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2008, : 205 - +
[2] Ordinal recursive complexity of Unordered Data Nets
Rosa-Velardo, Fernando
[J]. INFORMATION AND COMPUTATION, 2017, 254 : 41 - 58
[3] The Parametric Ordinal-Recursive Complexity of Post Embedding Problems
Karandikar, Prateek
Schmitz, Sylvain
[J]. FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES (FOSSACS 2013), 2013, 7794 : 273 - 288
[4] CHARACTERIZING COMPLEXITY CLASSES BY GENERAL RECURSIVE DEFINITIONS IN HIGHER TYPES
GOERDT, A
[J]. INFORMATION AND COMPUTATION, 1992, 101 (02) : 202 - 218
[5] CHARACTERIZING COMPLEXITY CLASSES BY GENERAL RECURSIVE DEFINITIONS IN HIGHER TYPES
GOERDT, A
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1989, 385 : 99 - 117
[6] CHARACTERIZING COMPLEXITY CLASSES BY HIGHER TYPE PRIMITIVE RECURSIVE DEFINITIONS
GOERDT, A
[J]. THEORETICAL COMPUTER SCIENCE, 1992, 100 (01) : 45 - 66
[7] CHARACTERIZING COMPLEXITY CLASSES BY HIGHER TYPE PRIMITIVE RECURSIVE DEFINITIONS
GOERDT, A
[J]. FOURTH ANNUAL SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, 1989, : 364 - 374
[8] Average-case complexity for the execution of recursive definitions on relational databases
de la Vega, WF
Paschos, VT
Stafylopatis, AN
[J]. ACTA INFORMATICA, 1998, 35 (03) : 211 - 243
[9] Average-case complexity for the execution of recursive definitions on relational databases
De la Vega W.F.
Paschos V.T.
Stafylopatis A.N.
[J]. Acta Informatica, 1998, 35 (3) : 211 - 243
[10] ON PROVABLY RECURSIVE FUNCTIONS AND ORDINAL RECURSIVE FUNCTIONS
KINO, A
[J]. JOURNAL OF THE MATHEMATICAL SOCIETY OF JAPAN, 1968, 20 (03) : 456 - +

← 1 2 3 4 5 →