In Quest of Information in Algorithmic Processes *

Abstract : Intuitively, an algorithm that is computing the value of a function for a given input, is extracting an information from the input and is processing this information. During this work the information being processed 'converges to the result'. We show by examples that one can measure this information convergence. No general theory is presented, though some questions that arise on the way towards such a theory are discussed. We start with an approach based on approximations of the graph of the computed function; we call this approach semantical. It works only for algorithms that mainly calculate but do not analyze the information being processed. We extend this approach by using syntactical considerations. The principle underlying the estimations of information convergence, is that of 'maximal uncertainty' that we impose on the algorithm under analysis. The problem of information convergence brings up conceptual questions " What is information? " , " What is uncertainty? " related to similar questions more and more intensively studied in philosophy.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [7 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01817887
Contributor : Anatol Slissenko <>
Submitted on : Monday, June 18, 2018 - 2:45:45 PM
Last modification on : Wednesday, December 19, 2018 - 3:50:03 PM
Document(s) archivé(s) le : Wednesday, September 26, 2018 - 6:27:26 PM

File

PhML2014PaperUpd.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01817887, version 1

Collections

Citation

Anatol Slissenko. In Quest of Information in Algorithmic Processes *. International Conf. Philosophy, Mathematics, Linguistics: Aspects of Interaction (PhML'2014), Apr 2014, Saint Peterburg, Russia. ⟨hal-01817887⟩

Share

Metrics

Record views

15

Files downloads

11