Interval-valued computation: Difference between revisions

Revision as of 10:23, 29 June 2008

Revision as of 10:27, 29 June 2008

Line 1:

'''''Interval computer'''''s are theoretical models for [[hypercomputation]]. There are no architectures for their physical implementations. Such a model of computation is capable of solving [[NP complete]] problems like [[tripartite matching]].<ref>[[#TaNa08|Tajti & Nagy 2008]]</ref> “The [[Boolean satisfiability problem#Extensions_of_SAT|validity problem of quantified propositional formulae]] is decidable by a linear interval-valued computation. As a consequence, all [[PSPACE|polynomial space problemsproblem]]s 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” (links added).<ref>[[#NaVá08|Nagy & Vályi 2008]]</ref>

== See also ==