Kolmogorov complexities Kmax, Kmin on computable partially ordered sets.Report as inadecuate




Kolmogorov complexities Kmax, Kmin on computable partially ordered sets. - Download this document for free, or read online. Document in PDF available to download.

* Corresponding author 1 LIAFA - Laboratoire d-informatique Algorithmique : Fondements et Applications

Abstract : We introduce a machine free mathematical framework to get a natural formaliza- tion of some general notions of infinite computation in the context of Kolmogorov complexity. Namely, the classes MaxX→D;PR and MaxX→D;Rec of functions X → D which are pointwise maximum of partial or total computable sequences of functions where D = D,



Author: Marie Ferbus-Zanda - Serge Grigorieff -

Source: https://hal.archives-ouvertes.fr/



DOWNLOAD PDF




Related documents