Interval-valued computations and their connection to PSPACE
Loading...
Date
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
At the conference CiE 2005, the first author introduced a new model for analog computations, namely interval-valued
computations. In this model, computations work on the so-called interval-valued bytes, which are special subsets of the interval
[0, 1) rather than a finite sequence of bits. The question was posed there, which complexity is needed to solve PSPACE-complete
problems in this paradigm. In this paper, after formalizing the computational model, we answer this question. We show that the
validity problem of quantified propositional formulae is decidable by a linear interval-valued computation. As a consequence, all
polynomial space problems are decidable by a polynomial interval-valued computation. Furthermore, it is proven that PSPACE
coincides with the class of languages which are decidable by a restricted polynomial interval-valued computation.
Description
copyright 2008 Elsevier B.V. All rights reserved. http://dx.doi.org/10.1016/j.tcs.2007.12.013