I will describe some interactions between algorithmic randomness and coarse computability, which make use of old and recent results on the interactions between random sets, highly nonrandom sets, and Turing reducibility. This is joint work with Carl Jockusch and Paul Schupp.