The use of randomness has played a key role in combinatorics since the introduction of the probabilistic method by Erdős in the 1940s. More recently, the use of pseudorandomness, referring to structures which seem random but are explicitly described, has become of increasing importance. In this talk, we describe a range of results making use of both randomness and pseudorandomness to study problems in extremal combinatorics.