On the extension of computable real functions

Mathieu Hoyrup 1 Walid Gomaa 2
1 CARTE - Theoretical adverse computations, and safety
Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
Abstract : We investigate interrelationships among different notions from mathematical analysis, effective topology, and classical computability theory. Our main object of study is the class of computable functions defined over an interval with the boundary being a left-c.e. real number. We investigate necessary and sufficient conditions under which such functions can be computably extended. It turns out that this depends on the behavior of the function near the boundary as well as on the class of left-c.e. real numbers to which the boundary belongs, that is, how it can be constructed. Of particular interest a class of functions is investigated: sawtooth functions constructed from computable enumerations of c.e. sets.
Type de document :
Communication dans un congrès
Logic In Computer Science (LICS), Jun 2017, Reykjavik, Iceland. 〈http://lics.rwth-aachen.de/lics17/〉
Liste complète des métadonnées

Littérature citée [11 références]  Voir  Masquer  Télécharger

Contributeur : Mathieu Hoyrup <>
Soumis le : jeudi 23 mars 2017 - 11:29:25
Dernière modification le : jeudi 11 janvier 2018 - 06:21:25
Document(s) archivé(s) le : samedi 24 juin 2017 - 12:26:20


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-01494332, version 1


Mathieu Hoyrup, Walid Gomaa. On the extension of computable real functions. Logic In Computer Science (LICS), Jun 2017, Reykjavik, Iceland. 〈http://lics.rwth-aachen.de/lics17/〉. 〈hal-01494332〉



Consultations de la notice


Téléchargements de fichiers