Algorithmic randomness is a concept in theoretical computer science and mathematics that characterizes sequences of numbers as random if they cannot be generated by any shorter algorithmic process than the sequence itself. It bridges the gap between randomness and computability, providing a rigorous framework for understanding randomness in terms of algorithmic information theory.