Randomness

Randomness describes a lack of definite patterns or predictability in information. While individual random events are unpredictable, they often follow a known probability distribution. This means that over many repeated trials, the frequency of different outcomes becomes predictable. For example, when throwing two dice, you cannot predict a single roll. However, a sum of seven will tend to occur twice as often as a sum of four. In this scientific view, randomness is not just haphazardness. Instead, it is a formal measure of the uncertainty surrounding an outcome.

Mathematics and statistics use specific constructs to manage this uncertainty. A random variable is a tool that assigns a numerical value to every possible outcome in an event space. This association allows researchers to calculate the probabilities of specific events. When these variables form a sequence without a deterministic pattern, it is called a random process. These processes evolve according to probability distributions. Scientists also use Monte Carlo methods, which rely on random inputs from generators to solve complex problems. These techniques are essential in the field of computational science.

Randomness can also be applied to the selection of items from a population. In a simple random sample, the probability of choosing a specific item is equal to its proportion in that population. Consider a bowl containing 10 red marbles and 90 blue marbles. A random selection mechanism would give a red marble a probability of 1/10. If the population contains distinguishable items, a truly random process requires that every member has an equal probability of being chosen. This ensures that the selection is unbiased and representative of the whole group.

History shows that humans have long struggled to understand chance.

In ancient history, randomness was often intertwined with the concept of fate. Many ancient peoples used dice to determine their destiny or played games of chance. Some cultures even used divination to try and circumvent the randomness of fate. In ancient Athenian democracy, a device called a kleroterion was used for sortition, or random selection. While the Chinese began formalizing odds roughly 3,000 years ago, Greek philosophers discussed randomness only in non-quantitative terms. It was not until the 16th century that Italian mathematicians began to formalize the odds of games. The later invention of calculus further advanced the formal study of these concepts.

In the physical sciences, randomness plays a fundamental role. In the 19th century, scientists used the random motions of molecules to develop statistical mechanics. This helped explain thermodynamics and the properties of gases. In quantum mechanics, many interpretations suggest that microscopic phenomena are objectively random. For instance, if you place a single unstable atom in a controlled environment, you cannot predict exactly when it will decay. You can only calculate the probability of decay within a certain timeframe. While some "hidden variable" theories suggest there are underlying causes, many scientists accept this irreducible randomness as a core part of nature.

Biology also relies on random processes to function. The modern evolutionary synthesis suggests that diversity in life comes from random genetic mutations followed by natural selection. While the location of a mutation might be somewhat protected, the mutations themselves are random. This randomness can even lead to the formation of entirely new behaviors and possibilities. In the animal kingdom, randomness serves as a survival strategy. For example, insects in flight often move with random changes in direction. This makes it difficult for predators to predict their trajectories and catch them.

Finally, randomness is a vital tool in modern information and computer science. In algorithmic information theory, a string of bits is considered random if it cannot be compressed. This is known as Kolmogorov randomness. In communication theory, randomness in a signal is referred to as "noise," which consists of transient disturbances. While noise can be a nuisance, computer scientists have learned to use randomness to their advantage. By deliberately introducing randomness into computations, they create randomized algorithms. In some specific cases, these randomized methods can actually outperform the best deterministic ones.