algorithmic randomness
A formal notion of randomness developed in computer science and associated with Gregory Chaitin, defining randomness through the incompressibility of algorithms or outputs.
As defined in William Byers on the Blind Spot, Science, and Uncertainty 05/16/2011
Where it comes up · 1
Most important claims · 2 of 2Search all claims for “algorithmic randomness” →
- There is no single concrete mathematical definition of randomness. Mathematicians, probabilists, evolutionary theorists, experimentalists, and Gregory Chaitin's algorithmic framework all use the same word in slightly different ways, so the concept shifts from discipline to discipline.William Byers on the Blind Spot, Science, and Uncertainty 05/16/2011
- Many definitions of randomness were originally tied to games of chance, and the computer led to new notions such as algorithmic randomness, showing that the concept is revised in response to new contexts.William Byers on the Blind Spot, Science, and Uncertainty 05/16/2011