*Kolmogorov complexity is the length of the shortest computer program that can p... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		baxtr 42 days ago \| parent \| context \| favorite \| on: LLMs encode how difficult problems are Kolmogorov complexity is the length of the shortest computer program that can produce a specific object as output. It formalizes the idea that simple objects have short descriptions, while complex (random) objects are incompressible.

dorgo 41 days ago [–]

The complex objects are conceptually similar to prime numbers.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact