# Connections between randomness and profinite groups

The current Logic Blog, Section 15 or so  contains new connections of randomness with algebra. Given a computable profinite group  the Haar measure is computable, so all the usual notions work. I’ve added one example where the effective form of an a.e. theorem needs only  Kurtz randomness. For other examples not even arithmetical randomness looks sufficient at present.