Loading...
Please wait, while we are loading the content...
Similar Documents
Interval-valued computations without the product operator
| Content Provider | Semantic Scholar |
|---|---|
| Author | Nagy, Benedek Vályi, Sándor |
| Copyright Year | 2007 |
| Abstract | In [1] B. Nagy introduced a new model for analog computations, namely the interval-valued computations, where computation is ex ecuted on so-called interval-valued bytes, which are special subsets of interv al [0,1) rather than a finite sequence of bits. The allowed set of computational operators on these values were motivated by the operators usually applied to finite sequences of bits, namely, Boolean operators and shifts, furthermore, a rather specific kind of “magnification” operator, named there fractalian product. In [4] S. Valyi and B. Nagy solved a PSPACE-complete problem by a linear interval-valued computation. This solution depend s on the possibility of construction of interval-values with arbitrarily sm all components and this step needs heavy application of products. In this article we show that omitting this operator still results in a computational device with a high computation power. Namely, we will demonstrate this by establishing that the finite variable satisfaction problem of quantified propositional formulae is still decidable by a fast (quadratic) interval-valued comp utation without any application of the product operator. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://icai.ektf.hu/pdf/ICAI2007-vol1-pp83-90.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
