algorithmic randomness
[/ˌælɡərɪðmɪk ˈrændəmnəs/]
noun
aleatoriedade algorítmica
1. A property of a sequence or string where no algorithm shorter than the sequence itself can generate it, implying the sequence is incompressible and contains no discernible pattern
Algorithmic randomness is used in computational complexity theory to define what it means for data to be truly random from a computational perspective.
A aleatoriedade algorítmica é usada na teoria da complexidade computacional para definir o que significa para dados serem verdadeiramente aleatórios de uma perspectiva computacional.
2. In the context of Kolmogorov complexity, a string is considered algorithmically random if its Kolmogorov complexity is approximately equal to its length
Algorithmic randomness provides a rigorous mathematical framework for distinguishing between truly random and pseudo-random sequences.
A aleatoriedade algorítmica oferece um marco matemático rigoroso para distinguir entre sequências verdadeiramente aleatórias e pseudo-aleatórias.
Algorithmic randomness is primarily a technical and academic term used in computer science, mathematics, and information theory. It emerged from the work of Kolmogorov and Martin-Löf in the mid-20th century. In Brazil and Portugal, this concept is taught in advanced computer science and mathematics programs. The term reflects a modern computational perspective on randomness that differs from classical statistical randomness, representing a significant conceptual shift in how Western academia and technology sectors understand unpredictability.
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →