  In these notes we present preliminary results on quantum-like algorithms
where tensor product is replaced by geometric product. Such algorithms possess
the essential properties typical of quantum computation (entanglement,
parallelism) but employ additional algebraic structures typical of geometric
algebra -- structures absent in standard quantum computation. As a test we
reformulate in Geometric Algebra terms the Deutsch-Jozsa problem.
