A theorem of Murskiĭ from the 1970s states that (under some extremely mild assumptions) a randomly-chosen finite algebra is primal with probability 1. I will sketch the proof of this result from universal algebra, which is quite combinatorial in nature. I will also explain how this relates to the theory of neural nets and gives a discrete universal approximation theorem.