On Entropic Convergence of Algorithms - Archive ouverte HAL Accéder directement au contenu
Proceedings/Recueil Des Communications Lecture Notes in Computer Sciences Année : 2020

On Entropic Convergence of Algorithms

Résumé

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. It is a way to relate the set-theoretic definition of a function to the program that computes it. The approach, though very preliminary, may show how to improve a given algorithm.
Fichier non déposé

Dates et versions

hal-04313954 , version 1 (29-11-2023)

Identifiants

  • HAL Id : hal-04313954 , version 1

Citer

Anatol Slissenko. On Entropic Convergence of Algorithms. Lecture Notes in Computer Sciences, 12180, pp.291-304, 2020, Fields of Logic and Computation III. ⟨hal-04313954⟩

Collections

LACL UPEC
4 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More