Abstract
Purchase PDF (180 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (15)
Purchase PDF (1134 K)
doi:10.1016/S0304-3975(98)00357-0 
Copyright © 1999 Elsevier Science B.V. All rights reserved.
and
characterized by programming languages
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Neil D. Jones1, 
Available online 15 October 1999.
Abstract
A programming approach to computability and complexity theory yields more natural definitions and proofs of central results than the classical approach. Further, some new results can be obtained using this viewpoint. This paper contains new intrinsic characterizations of the well-known complexity classes
and
, with no externally imposed resource bounds on time or space.
is proven identical with the decision problems solvable by read-only imperative programs on Lisp-like lists; and
is proven identical with the problems solvable by recursive read-only programs.
Author Keywords: Complexity; Read-only or cons-free programs;
;
1 This research was partially supported by the Danish Research Council (DART project), and the Esprit BRAs Semantique and Atlantique. An earlier version of this paper appeared in Electronic Notes in Theoretical Computer Science, proceedings of the 1995 meeting Mathematical Foundations of Programmming Semantics.
