They link to a comprehensive description of the randomness score at the bottom of the page: https://www.complexitycalculator.com/HowItWorks.html https://www.com

They link to a comprehensive description of the randomness score at the bottom of the page: https://www.complexitycalculator.com/HowItWorks.html https://www.complexitycalculator.com/HowItWorks.html It gets pretty theoretical, but basically it's estimating the Kolmogorov complexity by looking at the size of the Turing machine required to generate a particular string, rather than Shannon entropy or implementations of common compression techniques.