permacomputing

commit 11ceb184218d014972210ef77b3af94d3fedb0b5
parent 4f335c00db33676443bc60f6a290ce8b2f6c534f
Author: orx <orx@web>
Date:   Sun, 10 Jul 2022 22:23:27 +0200

empty web commit

Diffstat:
M
kolmogorov_complexity.mdwn
 | 
3
++-

1 file changed, 2 insertions(+), 1 deletion(-)
diff --git a/kolmogorov_complexity.mdwn b/kolmogorov_complexity.mdwn
@@ -2,9 +2,10 @@ The Kolmogorov complexity of an information object, such as a piece of text, is 
 
     KU( x) = min { |p| | p ∈ Σ∗0, U( p) = x } 
 
-    U - Turing machine
+    U - Universal Turing machine
     Σ - tape alphabet
     p - program
+    x - information object (text)
 
 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.