Superfast Algorithms and the Halting Problem in Geometric Algebra

Details Superfast Algorithms and the Halting Problem in Geometric Algebra Superfast Algorithms and the Halting Problem in Geometric Algebra

2006-11-05

arxiv.org/abs/quant-ph/0611051v1

Physics

Quantum Physics

4 pages, no figures, preliminary version, comments welcome

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Superfast Algorithms and the Halting Problem in Geometric Algebra does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Superfast Algorithms and the Halting Problem in Geometric Algebra, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Superfast Algorithms and the Halting Problem in Geometric Algebra will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-595032