In this work, we performed a comprehensive study about the foundations of algorithmic complexity and of information theory. The first deals with discrete sequences and is based on the concept of Kolmogorov - Chaitin complexity, and the second brings the notion of information entropy. We confronted the two theories and, after, we addressed the blind source separation problem, proposing an approach based on complexity measures by means of compression of the recurrence plots of the mixed signals.