Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
436472 | Theoretical Computer Science | 2008 | 15 Pages |
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 -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 coincides with the class of languages which are decidable by a restricted polynomial interval-valued computation.