permacomputing

commit 4f335c00db33676443bc60f6a290ce8b2f6c534f
parent 73884c9afea11ec02cf1a6cbc8a8919ccd5cae3e
Author: orx <orx@web>
Date:   Sun, 10 Jul 2022 22:21:57 +0200

empty web commit

Diffstat:
M
kolmogorov_complexity.mdwn
 | 
10
++++++----

1 file changed, 6 insertions(+), 4 deletions(-)
diff --git a/kolmogorov_complexity.mdwn b/kolmogorov_complexity.mdwn
@@ -17,11 +17,13 @@ The program (also called minimal description) received in language grammar syste
 
 Kolmogorov 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). 
 
-    o
-    
-Chaitin complexity is a minor modification of Kolmogorov complexity, which was discovered independently. We presumed that universal turing machine with alphabet Σ0, works with blanks on the tape to recognize end of programme. It can be a problem, because we cannot chain programmes or put data on tape without other delimiters etc. Chaitin complexity, also called self-delimiting complexity HU( x) of string x in universal machine U is a length of shortest self-delimiting program p, according to which U produces x.
+     o   U1(p)                   U2(p)  o
+    /|\      ------------------ >      /|\
+    / \               p                / \
 
-    HU( x) = min { | p | | U( p) = x, 
+Chaitin complexity is a minor modification of Kolmogorov complexity, which was discovered independently. We presumed that universal turing machine with alphabet Σ0, works with blanks on the tape to recognize end of programme. It can be a problem, because we cannot chain programmes or put data on tape without other delimiters etc. Chaitin complexity, also called self-delimiting complexity HU( x) of string x in universal machine U is a length of shortest self-delimiting program p, which in U produces x.
+
+    HU( x) = min { | p | | U( p) = x} 
  
     p is self-delimiting programme, that means the end of the programme
     can be recognized by reading only all of its symbols and nothing else.