We study the problem of determining the Boolean product of two n x n Boolean matrices in an unconventional computational model allowing for mechanical operations. We show that O(n(2)) operations are sufficient to compute the product in this model.