Overview

Kolmogorov complexity


Show Summary Details

Quick Reference

(K-complexity)

A theory of computational complexity based on the amount of information contained within entities. It was developed by the Russian mathematician Andrei Kolmogorov.

Subjects: Computing.


Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.