  We present a computational framework based on geometric structures. No
quantum mechanics is involved, and yet the algorithms perform tasks analogous
to quantum computation. Tensor products and entangled states are not needed --
they are replaced by sets of basic shapes. To test the formalism we solve in
geometric terms the Deutsch-Jozsa problem, historically the first example that
demonstrated the potential power of quantum computation. Each step of the
algorithm has a clear geometric interpetation and allows for a cartoon
representation.
