A look at the Kolmogorov complexity of finite groupoids and algebras

Carles Cardó

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. Th…