The incompressibility method is a counting argument in the framework of algorithmic complexity that permits discovering properties that are satisfied by most objects of a class. This paper gives a preliminary insight into Kolmogorov's complexity of groupoids and some algebras. The incompressibility method shows that almost all the groupoids are asymmetric and simple: Only trivial or constant homomorphisms are possible. However, highly random groupoids allow subgroupoids with interesting restrictions that reveal intrinsic structural properties. We also study the issue of the algebraic varieties and wonder which equational identities allow randomness.

翻译：不可压缩性方法是算法复杂性框架下的一种计数论证，可用于揭示某类对象中大多数对象所满足的性质。本文初步探讨了广群及部分代数的柯尔莫哥洛夫复杂性。不可压缩性方法表明，几乎所有广群都是非对称且简单的：仅存在平凡或常值同态。然而，高度随机的广群允许具有有趣限制的子广群，这些限制揭示了内在结构性质。我们还研究了代数簇问题，并探讨何种等式恒等式允许随机性存在。