Superfast Algorithms and the Halting Problem in Geometric Algebra

Simple item page
dc.creatorPawłowski, Marcin
dc.date2006-11-05
dc.date.accessioned2026-07-07T07:34:08Z
dc.date.available2026-07-07T07:34:08Z
dc.descriptionA 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.
dc.description4 pages, no figures, preliminary version, comments welcome
dc.identifierhttps://arxiv.org/abs/quant-ph/0611051
dc.identifierhttp://arxiv.org/abs/quant-ph/0611051
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/119704
dc.subjectQuantum Physics
dc.titleSuperfast Algorithms and the Halting Problem in Geometric Algebra
dc.typetext

Files

Collections

arXiv