On the computational complexity of Longeley's H functional

Authors:
James S. Royer
Affiliations:
Department of Electrical Engineering and Computer Science, Syracuse University, Syracuse, NY
Venue:
Theoretical Computer Science - Implicit computational complexity
Year:
2004

Citing 7
Cited 2

Theory of recursive functions and effective computability

Theory of recursive functions and effective computability
Subrecursive programming systems: complexity & succinctness

Subrecursive programming systems: complexity & succinctness
An introduction to Kolmogorov complexity and its applications (2nd ed.)

An introduction to Kolmogorov complexity and its applications (2nd ed.)
Computability and complexity: from a programming perspective

Computability and complexity: from a programming perspective
When is a functional program not a functional program?

Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
On characterizations of the basic feasible functionals, Part I

Journal of Functional Programming

A stable programming language

Information and Computation
A stable programming language

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.