AbstractBy the complexity KF(Φ) of the formula Φ: (A ⋁ B) ⇒ C we mean the minimal length of a program which on input 〈0, A〉 outputs C and on input 〈1, B〉 outputs C. We prove that there exist words A, B, C such that KF(Φ) is close to K(C¦A) + K(C¦B)
The subword complexity function pw of a finite word w over a finite alphabet A with cardA = q ≥ 1 is...
What is an algorithm and what is its complexity? + An algorithm takes Inputs and produces Outputs + ...
Assume that a program p on input a outputs b. We are looking for a shorter program q having the same...
AbstractBy the complexity KF(Φ) of the formula Φ: (A ⋁ B) ⇒ C we mean the minimal length of a progra...
We introduce a refinement of the usual Ehrenfeucht-Fra\"{\i}ss\'e game. The new game will help us ma...
AbstractLet x and y be binary strings. We prove that there exists a program p of size about K(x|y) t...
In this paper we examine the minimal-program complexity (i.e., the length of a shortest program for ...
AbstractOur goal is to study the complexity of infinite binary recursive sequences. We introduce sev...
AbstractConditional Kolmogorov complexity K(x|y) can be understood as the complexity of the problem ...
Shallit and Wang showed that the automatic complexity $A(x)$ satisfies $A(x)\ge n/13$ for almost all...
Each algorithm recognizing any generator of the class of context-free languages requires space Omega...
International audienceFor an extensive range of infinite words, and the associated symbolic dynamica...
The combined universal probability m(D) of strings x in sets D is close to max \m(x) over x in D: th...
This is a presentation about joint work between Hector Zenil and Jean-Paul Delahaye. Zenil presents ...
AbstractC.H. Bennett, P. Gács, M. Li, P.M.B. Vitányi, and W.H. Zurek have defined information distan...
The subword complexity function pw of a finite word w over a finite alphabet A with cardA = q ≥ 1 is...
What is an algorithm and what is its complexity? + An algorithm takes Inputs and produces Outputs + ...
Assume that a program p on input a outputs b. We are looking for a shorter program q having the same...
AbstractBy the complexity KF(Φ) of the formula Φ: (A ⋁ B) ⇒ C we mean the minimal length of a progra...
We introduce a refinement of the usual Ehrenfeucht-Fra\"{\i}ss\'e game. The new game will help us ma...
AbstractLet x and y be binary strings. We prove that there exists a program p of size about K(x|y) t...
In this paper we examine the minimal-program complexity (i.e., the length of a shortest program for ...
AbstractOur goal is to study the complexity of infinite binary recursive sequences. We introduce sev...
AbstractConditional Kolmogorov complexity K(x|y) can be understood as the complexity of the problem ...
Shallit and Wang showed that the automatic complexity $A(x)$ satisfies $A(x)\ge n/13$ for almost all...
Each algorithm recognizing any generator of the class of context-free languages requires space Omega...
International audienceFor an extensive range of infinite words, and the associated symbolic dynamica...
The combined universal probability m(D) of strings x in sets D is close to max \m(x) over x in D: th...
This is a presentation about joint work between Hector Zenil and Jean-Paul Delahaye. Zenil presents ...
AbstractC.H. Bennett, P. Gács, M. Li, P.M.B. Vitányi, and W.H. Zurek have defined information distan...
The subword complexity function pw of a finite word w over a finite alphabet A with cardA = q ≥ 1 is...
What is an algorithm and what is its complexity? + An algorithm takes Inputs and produces Outputs + ...
Assume that a program p on input a outputs b. We are looking for a shorter program q having the same...
DOI
Add to ORKG