The finite sequences the algorithmic complexities of which, with respect to a universal Turing machine, do not differ substantially from their corresponding lengths are known to be good simulations of statistically independent random samples from the equiprobable distribution. The aim of this paper is to suggest a possibility how to define, using the apparatus of algorithmic complexity, pseudo-random independent and equally distributed samples from a general probability distribution over a finite set and pseudo-Markov samples with a finite set of possible states.