LOGSPACE and PTIME characterized by programming languages

Theoretical Computer Science

Volumn 228, Issue 1-2, 1999, Pages 151-174

  Jones, Neil D ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

Complexity; LOGSPACE; PTIME; Read only or cons free programs

Indexed keywords

EID: 0002525390     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00357-0     Document Type: Article

References (16)

1. N. Andersen, N.D. Jones, Generalizing Cook's construction to imperative stack programs, Lecture Notes in Computer Science, vol. 812, Springer, Berlin, 1994, pp. 1-18.
2. S. Bellantoni, S.A. Cook, A new recursion-theoretic characterization of the polytime functions, Proc. 24th Symp. on the Theory of Computing, ACM Press, New York, 1992, pp. 283-293.
3. M. Blum, A machine-independent theory of the complexity of recursive functions, J. Assoc. Comput. Mach., 14 (2) (1967) 322-336.
4. S.A. Cook, Characterizations of pushdown machines in terms of time-bounded computers, J. Assoc. Comput. Mach. 18 (1971) 4-18.
5. S.A. Cook, Linear-time simulation of deterministic two-way pushdown automata, in: C.V. Freiman, (Ed.), Information Processing (IFIP) 71, North-Holland, Amsterdam, 1971, pp. 75-80.
6. J.-Y. Girard, A. Scedrov, P. Scott, Bounded linear logic: a modular approach to polynomial time computability, Theoret. Comput. Sci. 97 (1994) 1-66.
7. G. Hillebrand, P. Kanellakis, On the expressive power of simply typed and let-polymorphic lambda calculi, Logic in Computer Science, IEEE Computer Society Press, Silverspring, MD, 1996, pp. 253-263.
8. N. Immerman, Relational queries computable in polynomial time, Inform, and Comput. 68 (1986) 86-104.
9. N.D. Jones, A. Selman, Turing machines and the spectra of first-order formulae with equality, J. Symbolic Logic 39(1) (1974) 139-150.
10. N.D. Jones, Space-bounded reducibility among combinatorial problems, J. Comput. System Sci. 11 (1975) 68-85.
11. N.D. Jones, A note on linear-time simulation of deterministic two-way pushdown automata, Inform. Process. Lett. 6 (1977) 110-112.
12. N.D. Jones, Computability and Complexity from a Programming Perspective, MIT Press, Cambridge, MA, 1997.
13. D. Leivant, J-Y. Marion, Lambda calculus characterizations of ptime, Fund. Inform. 19 (1993) 167-184.
14. A. Meyer, D. Ritchie, A classification of the recursive functions, Z. MLG 18 (1972) 71-82.
15. H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967.
16. P. Wadler, Deforestation: transforming programs to eliminate trees, European Symp. On Programming (ESOP), Lecture Notes in Computer Science, vol. 300, Nancy, France, Springer, Berlin, 1988, pp. 344-358.