On a complexity of the formula (A β B) β
β
K.Yu. Gorbunov
π
Article
π
1998
π
Elsevier Science
π
English
β 285 KB
By the complexity KF'(@) of the formula @: (A V B) \* C we mean the minimal length of a program which on input (0,A) outputs C and on input (I,@ outputs C. We prove that there exist words A, B, C such that IQ'(@) is close to K(Cl.4) + K( ClB). @ 1998-Elsevier Science B.V. Ail rights reserved K~JNVIY