CHARACTERIZING COMPLEXITY CLASSES BY HIGHER TYPE PRIMITIVE RECURSIVE DEFINITIONS

被引：0

|

作者：

GOERDT, A

机构：

来源：

FOURTH ANNUAL SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE | 1989年

关键词：

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

收藏

页码：364 / 374

页数：11

相关论文

共 50 条

[1] CHARACTERIZING COMPLEXITY CLASSES BY HIGHER TYPE PRIMITIVE RECURSIVE DEFINITIONS
GOERDT, A
[J]. THEORETICAL COMPUTER SCIENCE, 1992, 100 (01) : 45 - 66
[2] CHARACTERIZING COMPLEXITY CLASSES BY HIGHER TYPE PRIMITIVE RECURSIVE DEFINITIONS .2.
GOERDT, A
SEIDL, H
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1990, 464 : 148 - 158
[3] CHARACTERIZING COMPLEXITY CLASSES BY GENERAL RECURSIVE DEFINITIONS IN HIGHER TYPES
GOERDT, A
[J]. INFORMATION AND COMPUTATION, 1992, 101 (02) : 202 - 218
[4] CHARACTERIZING COMPLEXITY CLASSES BY GENERAL RECURSIVE DEFINITIONS IN HIGHER TYPES
GOERDT, A
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1989, 385 : 99 - 117
[5] SEQUENTIAL REPRESENTATION OF PRIMITIVE RECURSIVE FUNCTIONS, AND COMPLEXITY CLASSES
WETTE, E
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1990, 440 : 422 - 437
[6] ELIMINATION OF HIGHER TYPE LEVELS IN DEFINITIONS OF PRIMITIVE RECURSIVE FUNCTIONALS BY MEANS OF TRANSFINITE RECURSION
SCHWICHT.H
[J]. JOURNAL OF SYMBOLIC LOGIC, 1974, 39 (02) : 425 - 425
[7] Primitive recursive equivalence relations and their primitive recursive complexity
Bazhenov, Nikolay
Ng, Keng Meng
San Mauro, Luca
Sorbi, Andrea
[J]. COMPUTABILITY-THE JOURNAL OF THE ASSOCIATION CIE, 2022, 11 (3-4): : 187 - 221
[8] ORDINAL COMPLEXITY OF RECURSIVE DEFINITIONS
FAIRTLOUGH, MVH
WAINER, SS
[J]. INFORMATION AND COMPUTATION, 1992, 99 (02) : 123 - 153
[9] Plain bases for classes of primitive recursive functions
Mazzanti, S
[J]. MATHEMATICAL LOGIC QUARTERLY, 2002, 48 (01) : 93 - 104
[10] CIRCUIT DEFINITIONS OF NONDETERMINISTIC COMPLEXITY CLASSES
VENKATESWARAN, H
[J]. SIAM JOURNAL ON COMPUTING, 1992, 21 (04) : 655 - 670

← 1 2 3 4 5 →