Calculating Kolmogorov Complexity from the Output Frequency Distributions of Small Turing Machines

Overview of attention for article published in PLOS ONE, May 2014

Altmetric Badge

About this Attention Score

Good Attention Score compared to outputs of the same age (70th percentile)
Above-average Attention Score compared to outputs of the same age and source (64th percentile)

Mentioned by

twitter: 6 X users

Citations

dimensions_citation: 122 Dimensions

Readers on

mendeley: 60 Mendeley

Summary X Dimensions citations

So far, Altmetric has seen 6 X posts from 6 X users, with an upper bound of 144,971 followers.

well now, isn't this a mighty fine data set to play with.... an approximation of the complete ouput frequency distribution of small turing machines. https://t.co/YlY0peEq6h

10 Nov 2021

Reply Repost Favourite

@brownstoneman Principe d'Occam, remanié par Kolmogorov : voilà un lien avec le github qui va bien: https://t.co/CWNlsUQiMO

18 Jul 2019

Reply Repost Favourite

My new paper in PLoS ONE http://t.co/WdHeADmoYT shows the only alternative to compression for the estimation of descriptive complexity.

18 May 2014

Reply Repost Favourite

My new paper in PLoS ONE http://t.co/WdHeADmoYT shows the only alternative to compression for the estimation of descriptive complexity.

18 May 2014

Reply Repost Favourite

This page shows the most recent X posts that mention this research output.

Click here to find out how to access more activity, including 2 additional X posts.