'''''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 [[http://en.wikipedia.org/wiki/SatisfiabilityBoolean satisfiability problem#Extensions_of_SAT|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” (links added).<ref>[[#NaVá08|Nagy & Vályi 2008]]</ref>
