||Classical computing paradigm (Turing machines, Neumann architecture)
is well-known and widely spread. There are problems that cannot be
computed efficiently in this paradigm (SAT: NP-complete; Q-SAT:
There is a nice way to visualise the (truth-table) evaluation of
SAT by interval-values.
The inteval-values and their proposed operations give an extension
of the classical computing paradigm. In this paradigm the SAT and
Q-SAT can be solved in a linear visual computation.