Characterizing PSPACE with pointers
Abstract 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 ch...
Published in: | Mathematical Logic Quarterly |
---|---|
Main Author: | |
Other Authors: | , , |
Format: | Article in Journal/Newspaper |
Language: | English |
Published: |
Wiley
2008
|
Subjects: | |
Online Access: | http://dx.doi.org/10.1002/malq.200610056 https://api.wiley.com/onlinelibrary/tdm/v1/articles/10.1002%2Fmalq.200610056 https://onlinelibrary.wiley.com/doi/pdf/10.1002/malq.200610056 |
id |
crwiley:10.1002/malq.200610056 |
---|---|
record_format |
openpolar |
spelling |
crwiley:10.1002/malq.200610056 2024-09-15T18:39:02+00:00 Characterizing PSPACE with pointers Oitavem, Isabel UNL CMAF FCT 2008 http://dx.doi.org/10.1002/malq.200610056 https://api.wiley.com/onlinelibrary/tdm/v1/articles/10.1002%2Fmalq.200610056 https://onlinelibrary.wiley.com/doi/pdf/10.1002/malq.200610056 en eng Wiley http://onlinelibrary.wiley.com/termsAndConditions#vor Mathematical Logic Quarterly volume 54, issue 3, page 323-329 ISSN 0942-5616 1521-3870 journal-article 2008 crwiley https://doi.org/10.1002/malq.200610056 2024-07-04T04:31:31Z Abstract 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. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) Article in Journal/Newspaper The Pointers Wiley Online Library Mathematical Logic Quarterly 54 3 323 329 |
institution |
Open Polar |
collection |
Wiley Online Library |
op_collection_id |
crwiley |
language |
English |
description |
Abstract 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. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) |
author2 |
UNL CMAF FCT |
format |
Article in Journal/Newspaper |
author |
Oitavem, Isabel |
spellingShingle |
Oitavem, Isabel Characterizing PSPACE with pointers |
author_facet |
Oitavem, Isabel |
author_sort |
Oitavem, Isabel |
title |
Characterizing PSPACE with pointers |
title_short |
Characterizing PSPACE with pointers |
title_full |
Characterizing PSPACE with pointers |
title_fullStr |
Characterizing PSPACE with pointers |
title_full_unstemmed |
Characterizing PSPACE with pointers |
title_sort |
characterizing pspace with pointers |
publisher |
Wiley |
publishDate |
2008 |
url |
http://dx.doi.org/10.1002/malq.200610056 https://api.wiley.com/onlinelibrary/tdm/v1/articles/10.1002%2Fmalq.200610056 https://onlinelibrary.wiley.com/doi/pdf/10.1002/malq.200610056 |
genre |
The Pointers |
genre_facet |
The Pointers |
op_source |
Mathematical Logic Quarterly volume 54, issue 3, page 323-329 ISSN 0942-5616 1521-3870 |
op_rights |
http://onlinelibrary.wiley.com/termsAndConditions#vor |
op_doi |
https://doi.org/10.1002/malq.200610056 |
container_title |
Mathematical Logic Quarterly |
container_volume |
54 |
container_issue |
3 |
container_start_page |
323 |
op_container_end_page |
329 |
_version_ |
1810483424952057856 |