Skip to Main content Skip to Navigation
New interface
Conference papers

Topological analysis of representations

Mathieu Hoyrup 1, 2 
1 CARTE - Theoretical adverse computations, and safety
Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
2 MOCQUA - Designing the Future of Computational Models
Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
Abstract : Computable analysis is the theoretical study of the abilities of algorithms to process infinite objects. The algorithms abilities depend on the way these objects are presented to them. We survey recent results on the problem of identifying the properties of objects that are decidable or semidecidable, for several concrete classes of objects and representations of them. Topology is at the core of this study, as the decidable and semidecidable properties are closely related to the open sets induced by the representation.
Complete list of metadata

Cited literature [21 references]  Display  Hide  Download
Contributor : Mathieu Hoyrup Connect in order to contact the contributor
Submitted on : Monday, November 12, 2018 - 1:54:57 PM
Last modification on : Saturday, June 25, 2022 - 7:41:02 PM
Long-term archiving on: : Wednesday, February 13, 2019 - 2:40:35 PM


Files produced by the author(s)


  • HAL Id : hal-01919395, version 1



Mathieu Hoyrup. Topological analysis of representations. CiE 2018 - Fourteenth conference on Computability in Europe, Jul 2018, Kiel, Germany. ⟨hal-01919395⟩



Record views


Files downloads