On entropic convergence of algorithms in terms of domain partitions

Abstract : The paper describes an approach to measuring convergence of an algorithm to its result in terms of an entropy-like function of partitions of its inputs of a given length. The goal is to look at the algorithmic data processing from the viewpoint of information transformation, with a hope to better understand the work of algorithm, and maybe its complexity. The entropy is a measure of uncertainty, it does not correspond to our intuitive understanding of information. However, it is what we have in this area. In order to realize this approach we introduce a measure on the inputs of a given length based on the Principle of Maximal Uncertainty: all results should be equiprobable to the algorithm at the beginning. An algorithm is viewed as a set of events, each event is an application of a command. The commands are very basic. To measure the convergence we introduce a measure that is called entropic weight of events of the algorithm. The approach is illustrated by two examples.
Document type :
Preprints, Working Papers, ...
Liste complète des métadonnées

Cited literature [2 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01817834
Contributor : Anatol Slissenko <>
Submitted on : Monday, June 18, 2018 - 2:17:11 PM
Last modification on : Wednesday, December 19, 2018 - 3:50:03 PM
Document(s) archivé(s) le : Wednesday, September 19, 2018 - 9:35:03 PM

File

EntropicConvergenceArXiv.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Anatol Slissenko. On entropic convergence of algorithms in terms of domain partitions. 2016. ⟨hal-01817834⟩

Share

Metrics

Record views

40

Files downloads

21