permacomputing

Source repository for the main permacomputing wiki site
git clone http://git.permacomputing.net/repos/permacomputing.git # read-only access
Log | Files | Refs
commit b708d7587b85358e41df944743ee765a07f21973
parent cb4f6fdd0eff8a877b3478e743349e95dc959435
Author: neau <neau@web>
Date:   Wed, 22 Jun 2022 01:46:49 +0200

empty web commit

Diffstat:

Akolmogorov_complexity.mdwn | 1+


1 file changed, 1 insertion(+), 0 deletions(-)

diff --git a/kolmogorov_complexity.mdwn b/kolmogorov_complexity.mdwn
@@ -0,0 +1 @@
+The Kolmogorov complexity of an object, such as a piece of text, is the length of the shortest computer program that produces the object as output. It is a measure of the computational resources needed to specify the object, and is also known as algorithmic complexity.