Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Computer Science Logic

CSL 1994: Computer Science Logic pp 486–500Cite as

Ramified recurrence and computational complexity II: Substitution and poly-space

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 933))

Abstract

We prove an applicative characterization of poly-space as the set of functions over \(\mathbb{W} = \{ 0,1\} *\)defined by ramified \(\mathbb{W}\)-recurrence with parameter substitution. Intuitively, parameter substitution allows re-use of space in ways disallowed by ramified recurrence without substitution: it permits capturing by recurrence the flow of computation backwards from accepting configurations, thereby enabling the simulation of parallel (alternating) computing. Conversely, parameter substitution can be simulated by a computation that can repeatedly bifurcate into subcomputations, i.e. by parallelism that can be captured in poly-space.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abiteboul and V. Vianu. Fixpoint extensions of first-order logic and datalog-like languages. In Proceedings of the Fourth Annual Symposium on Logic in Computer Science, pages 71–79, Washington, D.C., 1989. IEEE Computer Society Press.

    Google Scholar 

  2. S. Abiteboul and V. Vianu. Datalog extensions for database queries and updates. Journal of Computer and System Sciences, 43:62–124, 1991.

    Article  Google Scholar 

  3. S. Abiteboul, E. Simon, and V. Vianu. Non-deterministic languages to express deterministic transformations. In Proc. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1990.

    Google Scholar 

  4. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, Reading, MA, 1994.

    Google Scholar 

  5. Stephen Bellantoni and Stephen Cook. A new recursion-theoretic characterization of the poly-time functions, 1992.

    Google Scholar 

  6. Stephen Bellantoni. Predicative Recursion and Computational Complexity. PhD thesis, University of Toronto, 1992.

    Google Scholar 

  7. Stephen Bellantoni. Predicative recursion and the polytime hierarchy. In Peter Clote and Jeffery Remmel, editors, Feasible Mathematics II, Perspectives in Computer Science. Birkhäuser, 1994.

    Google Scholar 

  8. Stephen Bloch. Functional characterizations of uniform log-depth and polylogdepth circuit families. In Proceedings of the Seventh Annual Structure in Complexity Theory Conference, pages 193–206. IEEE Computer Society Press, 1992.

    Google Scholar 

  9. A.J. Bonner. Hypothetical datalog: complexity and expressibility. In Proceedings of the International Conference on Database Theory, volume 326 of LNCS, pages 144–160, Berlin, 1988.

    Google Scholar 

  10. Ashok Chandra, Dexter Kozen, and Larry Stockmeyer. Alternation. Journal of the ACM, 28:114–133, 1981.

    Article  Google Scholar 

  11. A. Cobham. The intrinsic computational difficulty of functions. In Y. Bar-Hillel, editor, Proceedings of the International Conference on Logic, Methodology, and Philosophy of Science, pages 24–30. North-Holland, Amsterdam, 1965.

    Google Scholar 

  12. R. Fagin. Generalized first order spectra and polynomial time recognizable sets. In R. Karp, editor, Complexity of Computation, pages 43–73. SIAM-AMS, 1974.

    Google Scholar 

  13. Andreas Goerdt. Characterizing complexity classes by higher-type primitive-recursive definitions. Theoretical Computer Science, 100:45–60, 1992. Preliminary version in: Proceedings of the Fourth IEEE Symposium on Logic in Computer Science, 1989, 364–374.

    Article  Google Scholar 

  14. Y. Gurevich and S. Shelah. Fixed-point extensions of first-order logic. Annals of Pure and Applied Logic, 32:265–280, 1986.

    Article  Google Scholar 

  15. Yuri Gurevich. Algebras of feasible functions. In Twenty Fourth Symposium on Foundations of Computer Science, pages 210–214. IEEE Computer Society Press, 1983.

    Google Scholar 

  16. W.G. Handley. Bellantoni and Cook's characterization of polynomial time functions. Typescript, August 1992.

    Google Scholar 

  17. Neil Immerman. Number of quantifiers is better than number of tape cells. Journal of Computer and System Sciences, 22:384–406, 1981. Preminary version in Proceedings of the 20th IEE Symposium on Foundations of Computer Science (1979), 337–347.

    Article  Google Scholar 

  18. N. Immerman. Upper and lower bounds for first-order expressibility. Journal of Computer and System Sciences, 25:76–98, 1982. Preliminary version in focs81, 74–82.

    Article  Google Scholar 

  19. N. Immerman. Relational queries computable in polynomial time. Information and Control, 68:86–104, 1986. Preliminary report in Fourteenth ACM Symposium on Theory of Computing, 1982, pp. 147–152.

    Article  Google Scholar 

  20. N. Immerman. Languages that capture complexity classes. SIAM Journal of Computing, 16:760–778, 1987.

    Article  Google Scholar 

  21. Neil Immerman. Dspace[n k] = var[k + 1]. In Proc. 6th IEEE Symp. on Structure in Complexity Theory, pages 334–340, 1991.

    Google Scholar 

  22. N.G. Jones and A.L. Selman. Turing machines and the spectra of first order formulas. Journal of Symbolic Logic, 39:139–150, 1974.

    Google Scholar 

  23. Daniel Leivant. Inductive definitions over finite structures. Information and Computation, 89:95–108, 1990.

    Article  Google Scholar 

  24. Daniel Leivant. Subrecursion and lambda representation over free algebras. In Samuel Buss and Philip Scott, editors, Feasible Mathematics, Perspectives in Computer Science, pages 281–291. Birkhauser-Boston, New York, 1990.

    Google Scholar 

  25. Daniel Leivant. Stratified functional programs and computational complexity. In Conference Record of the Twentieth Annual ACM Symposium on Principles of Programming Languages, New York, 1993. ACM.

    Google Scholar 

  26. Daniel Leivant. Predicative recurrence in finite type. In A. Nerode and Yu.V. Matiyasevich, editors, Logical Foundations of Computer Science, LNCS #813, pages 227–239, Berlin, 1994. Springer-Verlag. Proceedings of the Third LFCS Symposium, St. Petersburg.

    Google Scholar 

  27. Daniel Leivant. Ramified recurrence and computational complexity I: Word recurrence and poly-time. In Peter Clote and Jeffrey Remmel, editors, Feasible Mathematics II. Birkhauser-Boston, New York, 1994.

    Google Scholar 

  28. Yiannis Moschovakis. Abstract recursion as the foundation for a theory of algorithms. In Computation and Proof Theory (Proceedings of the ASL Meeting in Aachen, 1983), Lecture notes in Mathematics, Berlin, 1983. Springer Verlag.

    Google Scholar 

  29. Anhlan P. Nguyen. A formal system for linear space reasoning. PhD thesis, University of Toronto, 1993. Master of Science Thesis.

    Google Scholar 

  30. J. Otto. V-comprehensions and P space. Preprint, 1995.

    Google Scholar 

  31. R.W. Ritchie. Classes of predictably computable functions. Trans. A.M.S., 106:139–173, 1963.

    Google Scholar 

  32. H.E. Rose. Subrecursion. Clarendon Press (Oxford University Press), Oxford, 1984.

    Google Scholar 

  33. Harold Simmons. The realm of primitive recursion. Archive for Mathematical Logic, 27:177–, 1988.

    Article  Google Scholar 

  34. Iain A. Stewart. Logical and semantic characterization of complexity classes. Acta Informatica, 30:61–87, 1993.

    Article  Google Scholar 

  35. D.B. Thompson. Subrecursiveness: machine independent notions of computability in restricted time and storage. Math. System Theory, 6:3–15, 1972.

    Article  Google Scholar 

  36. J. Tiuryn and P. Urzyczyn. Some relationships between logics of programs and complexity theory. Theoretical Computer Science, 60:83–108, 1988.

    Article  Google Scholar 

  37. J.V. Tucker and J.I. Zucker. Program Correctness over Abstract Data Types, with Error-State Semantics. CWI Monographs No. 6. North-Holland and the Centre for Mathematics and Computer Science, Amsterdam, 1988.

    Google Scholar 

  38. M. Vardi. Complexity and relational query languages. In Fourteenth Symposium on Theory of Computing, pages 137–146. ACM, New York, 1982.

    Google Scholar 

  39. K.N. Venkataraman, Ann Yasuhara, and Frank M. Hawrusik. A view of computability on term algebras. Journal of Computer and System Sciences, 26(2):410–471, June 1983.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Indiana University, 47405, Bloomington, IN, USA

    Daniel Leivant

  2. CRIN - CNRS - INRIA Lorraine, Université Nancy I, 54506, Vandœuvre-lés-Nancy Cedex, France

    Jean-Yves Marion

Authors
  1. Daniel Leivant
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jean-Yves Marion
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Leszek Pacholski Jerzy Tiuryn

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Leivant, D., Marion, JY. (1995). Ramified recurrence and computational complexity II: Substitution and poly-space. In: Pacholski, L., Tiuryn, J. (eds) Computer Science Logic. CSL 1994. Lecture Notes in Computer Science, vol 933. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022277

Download citation

  • DOI: https://doi.org/10.1007/BFb0022277

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60017-6

  • Online ISBN: 978-3-540-49404-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation