Abstract:
This paper investigates analogs of the Kreisel-Lacombe-Shoenfield Theorem in the context of the type-2 basic feasible functionals. We develop a direct, polynomial-time analog of effective operation in which the time boundingon computations is modeled after Kapron and Cook's scheme for their basic polynomial-time functionals. We show that if P NP, these polynomial-time effective operations are strictly more powerful on R (the class of recursive functions) than the basic feasible functions. We also consider a weaker notion of polynomial-time effective operation where the machines computing these functionals have access to the computations of their procedural parameter, but not to its program text. For this version of polynomial-time effective operations, the analog of the Kreisel-Lacombe-Shoenfield is shown to hold---their power matches that of the basic feasible functionals on R.
Citations
|
2770
|
Introduction to Automata Theory, Language, and Computation
– Hopcroft, Ullman
- 1979
|
|
535
|
Theory of Recursive Functions and Effective Computability
– Rogers
- 1967
|
|
229
|
Classical Recursion Theory
– Odifreddi
- 1989
|
|
159
|
Structural Complexity I
– Balc'azar, D'iaz, et al.
- 1988
|
|
108
|
The intrinsic computational difficulty of functions
– Cobham
- 1965
|
|
77
|
Functional interpretations of feasibly constructive arithmetic
– Cook, Urquhart
- 1993
|
|
50
|
Tally languages and complexity classes
– Book
- 1974
|
|
37
|
A new characterization of type 2 feasibility
– Kapron, Cook
- 1996
|
|
32
|
Computability and complexity of higher type functions
– Cook
- 1992
|
|
30
|
Characterizations of the basic feasible functions of finite type
– Cook, Kapron
- 1990
|
|
28
|
Polynomial and abstract subrecursive classes
– Mehlhorn
- 1976
|
|
23
|
The polynomial hierarchy and intuitionistic bounded arithmetic
– Buss
- 1986
|
|
22
|
Complexity theory of higher type functionals
– Seth
- 1994
|
|
22
|
LCF considered as a programming language. Theoret.Comput. Sci
– Plotkin
- 1977
|
|
16
|
Subrecursive programming systems
– Royer, Case
- 1994
|
|
15
|
There is no recursive axiomatization for feasible functionals of type 2
– Seth
- 1992
|
|
15
|
Turing machine characterizations of feasible functionals of all finite types, Feasible Mathematics
– Seth
- 1995
|
|
13
|
Computability, Complexity and Languages
– Davis, Weyuker
- 1983
|
|
9
|
Partial recursive functionals and effective operations
– Kreisel, Lacombe, et al.
- 1957
|
|
6
|
Effective operations on partial recursive functions
– Myhill, Shepherdson
- 1955
|
|
5
|
An introduction to the general theory of algorithms, North-Holland
– Machtey, Young
- 1978
|
|
4
|
Lambda calculus and recursion theory
– Scott
- 1975
|
|
1
|
Un contre-example relatif aux fonctionnelles recursives, Comptes Rendus Hebdomadaires des seances de l'Academie des Sciences 247
– Friedberg
- 1958
|
|
1
|
A new characterizationof Mehlhorn's polynomial time functionals
– Kapron, Cook
- 1991
|
|
1
|
LCF considered as a programminglanguage, Theoretical Computer Science 5
– Plotkin
- 1977
|
|
1
|
A new characterization of Mehlhorn'spolynomial time functionals
– Kapron, Cook
- 1991
|
|
