Universality is the occurrence of common behavior or structure across a broad class of systems despite differences in their detailed descriptions. The term has several distinct technical senses in mathematics.
In probability, a limiting law is called universal when suitably normalized quantities drawn from a broad class have the same limiting statistical distribution. The central limit theorem is a basic example governed by the Lindeberg universality principle: independent random variables satisfying suitable hypotheses lead to a normal distribution regardless of many details of their individual laws. As a result, the details of individual distributions can be forgotten while a common macroscopic law remains (Tropp 2023, pp. 275-276; Big Think 2026). A more specialized example occurs in random matrix theory, where local eigenvalue statistics can depend only on broad symmetry features rather than on the precise law governing the matrix entries (Tao and Vu 2011).
In the theory of computation, universality is the property of being able to perform different tasks with the same underlying construction by changing its program. Universal systems are effectively capable of emulating any other system. Digital computers are universal, but proving that idealized computational systems are universal can be extremely difficult and technical. Examples have nevertheless been found in many systems. Any system that can be translated into another system known to be universal must itself be universal. Specific universal Turing machines, universal cellular automata (in both one and two dimensions), and universal cyclic tag systems are known. Among elementary cellular automata, Rule 110 is universal (Wolfram 2002, Cook 2004).
