a toy model, we have shown that Hamming and Euclidean measures of similarity perform very well under the agent-object construction with odding blades.

We also studied the ways in which the number of potential answers is affected by situations in which the system draws at random identical blades denoting different atomic objects or in which identical sentence chunks are produced from different blades. A formula estimating the number of potential counterparts of a noisy piece of information has been derived. Finally, the performance of the GA model has been compared with that of BSC and HRR models using sentences of various complexity.

Acknowledgements I would like to thank Rafał Abłamowicz and Ian Bell for many inspiring conversations that took place during the AGACSE conference in Grimma in August 2008. Furthermore, my participation in that conference would not have been possible without the support from Centrum Leo Apostel (CLEA) at the Vrije Universiteit in Brussels. I also acknowledge support from the LFPPI network.

## References

1. D. Aerts, M. Czachor, B. De Moor, On geometric-algebra representation of binary spatter codes, preprint arXiv:cs/0610075 [cs.AI] (2006).

2. D. Aerts, M. Czachor, *Cartoon computation: Quantum-like algorithms without quantum mechanics*, J. Phys. A 40, F259 (2007).

3. D. Aerts, M. Czachor, *Tensor-product vs. geometric-product coding*, Phys. Rev. A 77, 012316
(2008), arXiv:0709.1268 [quant-ph].

4. D. Aerts, M. Czachor, B. De Moor, *Geometric Analogue of Holographic Reduced Representation*, preprint arXiv:0710.2611 (2007).

5. E. Bayro-Corrochano, *Handbook of Geometric Computing*, (Springer, Berlin 2005). 6. M. Czachor, *Elementary gates for cartoon computation*, J. Phys. A 40, F753 (2007).

7. L. Dorst, D. Fontijne, S. Mann, *Geometric Algebra for Computer Science*, (MorganKauffman, Elsevier 2007).

8. D. Hestenes, *Space-Time Algebra*, (Gordon and Breach, New York, 1966).

9. D. Hestenes, G. Sobczyk, Clifford Algebra to Geometric Calculus: A Unified Language for Mathematics and Physics, (Reidel, Dordrecht, 1984).

10. P. Kanerva, *Binary spatter codes of ordered k-tuples*, Artificial Neural Networks ICANN
Proceedings, Lecture Notes in Computer Science vol. 1112, pp. 869-873, C. von der Malsburg et al. (Eds.), (Springer, Berlin 1996).

11. P. Kanerva, *Fully distributed representation*, Proc. 1997 Real World Computing Symposium
(RWC97, Tokyo), pp. 358-365 (Real World Computing Partnership, Tsukuba-City, Japan, 1997).

12. P. Lounesto, *Clifford Algebras and Spinors*, 2nd ed., Cambridge University Press, 2001.

13. T. Plate, Holographic Reduced Representation: Distributed Representation for Cognitive Structures, (CSLI Publications, Stanford, 2003).

14. P. Smolensky, Tensor product variable binding and the representation of symbolic structures in connectionist systems, Artificial Intelligence, 46:159216 (1990).

15. P. Smolensky, C. Dolan, *Tensor product production system: a modular architecture and representation*, Connection Science, 1(1):5368 (1989).