On the computational complexity of Longley's H functional

Longley discovered a functional H that, when added to PCF, yields a language that computes exactly SR, the sequentially realizable functionals of van Oosten. We show that if P ≠ NP, then the computational complexity of H (and of similar SR-functionals) is inherently infeasible.

[1]  John Longley.  The sequentially realizable functionals , 2002, Ann. Pure Appl. Log..

[2]  Stephen A. Cook,et al.  Functional interpretations of feasibly constructive arithmetic , 1989, STOC '89.

[3]  J. V. Oosten,et al.  A combinatory algebra for sequential functionals of finite type , 1997 .

[4]  Nachum Dershowitz,et al.  Abstract Effective Models , 2006, Electron. Notes Theor. Comput. Sci..

[5]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[6]  D. C. Cooper,et al.  Theory of Recursive Functions and Effective Computability , 1969, The Mathematical Gazette.

[7]  Richard M. Karp,et al.  Reducibility among combinatorial problems" in complexity of computer computations , 1972 .

[8]  James S. Royer,et al.  Subrecursive Programming Systems , 1994, Progress in Theoretical Computer Science.

[9]  Jr. Hartley Rogers.  Theory of Recursive Functions and Effective Computability , 1969 .

[10]  Neil D. Jones,et al.  Computability and complexity - from a programming perspective , 1997, Foundations of computing series.

[11]  John Longley.  Matching typed and untyped realizability , 2000, Electron. Notes Theor. Comput. Sci..

[12]  P. Odifreddi.  Classical recursion theory , 1989 .

[13]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[14]  John Longley.  When is a functional program not a functional program? , 1999, ICFP '99.

[15]  John Longley.  Realizability Models for Sequential Computation , 1998 .

[16]  Bruce M. Kapron,et al.  On characterizations of the basic feasible functionals, Part I , 2001, Journal of Functional Programming.

[17]  Paul M. B. Vitányi,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 1993, Graduate Texts in Computer Science.

[18]  Raymond E. Miller,et al.  Complexity of Computer Computations , 1972 .

[19]  J. Case,et al.  Subrecursive Programming Systems: Complexity & Succinctness , 1994 .