  A new type of algorithms is presented that combine the advantages of quantum
and classical ones. Those combined advantages along with aspects of Geometric
Algebra that open possibilities unavailable to both of these computations are
exploited to obtain database search and number factoring algorithms that are
faster than the quantum ones, and even to create a ''pseudoalgorithm'' that can
perform noncomputational tasks.
