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 45af52fa39274121b569d98b689c5a2ad0d94028
parent a46623ecc781e1802d03c57bd98cc1b1aa54d3e1
Author: orx <orx@web>
Date:   Thu, 30 Jun 2022 01:57:51 +0200

Extension, art relation.

Diffstat:
Mkolmogorov_complexity.mdwn | 6+++++-
1 file changed, 5 insertions(+), 1 deletion(-)

diff --git a/kolmogorov_complexity.mdwn b/kolmogorov_complexity.mdwn @@ -1 +1,5 @@ -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. +The Kolmogorov complexity of an information 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. + +The program (also called minimal description) received in language grammar system common for both sides triggers generative action on receiver side producing the same language information as by transmission originator. + +This computational principle from 1963 can be related to association in psychology and art. With association, previous experience is recalled from memory by a short impulse or pretext. Vladimir Boudnik in Explosionalism (1949) states that image is built layered on previous influences, memories and experiences. Artwork is a shot which explodes in people's heads (like infinite stream of associations).