Characterizing PSPACE with pointers

Research output: Contribution to journalArticlepeer-review

10 Citations (Scopus)


This paper gives an implicit characterization of the class of functions computable in polynomial space by deterministic Turing machines - PSPACE. It gives an inductive characterization of PSPACE with no ad-hoc initial functions and with only one recursion scheme. The main novelty of this characterization is the use of pointers (also called path information) to reach PSPACE. The presence of the pointers in the recursion on notation scheme is the main difference between this characterization of PSPACE and the well-known Bellantoni-Cook characterization of the polytime functions - PTIME.

Original languageEnglish
Pages (from-to)323-329
Number of pages7
JournalMathematical Logic Quarterly
Issue number3
Publication statusPublished - Jun 2008


  • Computational complexity
  • Implicit characterization


Dive into the research topics of 'Characterizing PSPACE with pointers'. Together they form a unique fingerprint.

Cite this