Add to ORKGWe propose a variant of the Kolmogorov concept of complexity which yields a common theory of finite and infinite random sequences. The process complexity does not oscillate. We establish some concepts of effective tests which are proved to be equivalent
We argue that Martin-Lof tests provide useful techniques in proofs involving Kolmogorov complexity. ...
We introduce randomized time-bounded Kolmogorov complexity (rKt), a natural extension of Levin's not...
We introduce randomized time-bounded Kolmogorov complexity (rKt), a natural extension of Levin\u27s ...
Kolmogorov has defined the conditional complexity of an object y when the object x is already given ...
Kolmogorov has defined the conditional complexity of an object y when the object x is already given ...
The first part of this paper is a review of basic notions and results connected with Kolmogorov comp...
The first part of this paper is a review of basic notions and results connected with Kolmogorov comp...
Thèse lauréate du prix Gilles Kahn 2008This thesis is a contribution to the study of the different n...
We argue that Martin-L\"{o}f tests provide useful techniques in proofs involving Kolmogorov complexi...
We observe that known results on the Kolmogorov complexity of prefixes of effectively stochastic seq...
summary:Classes of strings (infinite sequences resp.) with a specific flow of Kolmogorov complexity ...
In 1964 Kolmogorov introduced the concept of the complexity of a finite object (for instance, the wo...
summary:Classes of strings (infinite sequences resp.) with a specific flow of Kolmogorov complexity ...
An infinite binary sequence has randomness rate at least $sigma$ if, for almost every $n$, the Kolmo...
summary:An attempt to formalize heuristic concepts like strings (sequences resp.) “typical” for a pr...
We argue that Martin-Lof tests provide useful techniques in proofs involving Kolmogorov complexity. ...
We introduce randomized time-bounded Kolmogorov complexity (rKt), a natural extension of Levin's not...
We introduce randomized time-bounded Kolmogorov complexity (rKt), a natural extension of Levin\u27s ...
Kolmogorov has defined the conditional complexity of an object y when the object x is already given ...
Kolmogorov has defined the conditional complexity of an object y when the object x is already given ...
The first part of this paper is a review of basic notions and results connected with Kolmogorov comp...
The first part of this paper is a review of basic notions and results connected with Kolmogorov comp...
Thèse lauréate du prix Gilles Kahn 2008This thesis is a contribution to the study of the different n...
We argue that Martin-L\"{o}f tests provide useful techniques in proofs involving Kolmogorov complexi...
We observe that known results on the Kolmogorov complexity of prefixes of effectively stochastic seq...
summary:Classes of strings (infinite sequences resp.) with a specific flow of Kolmogorov complexity ...
In 1964 Kolmogorov introduced the concept of the complexity of a finite object (for instance, the wo...
summary:Classes of strings (infinite sequences resp.) with a specific flow of Kolmogorov complexity ...
An infinite binary sequence has randomness rate at least $sigma$ if, for almost every $n$, the Kolmo...
summary:An attempt to formalize heuristic concepts like strings (sequences resp.) “typical” for a pr...
We argue that Martin-Lof tests provide useful techniques in proofs involving Kolmogorov complexity. ...
We introduce randomized time-bounded Kolmogorov complexity (rKt), a natural extension of Levin's not...
We introduce randomized time-bounded Kolmogorov complexity (rKt), a natural extension of Levin\u27s ...