Topological analysis of representations

Mathieu Hoyrup (1, 2)

1 CARTE - Theoretical adverse computations, and safety
2 MOCQUA - Designing the Future of Computational Models

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.

Domaines: Logique en informatique [cs.LO]; Logique [math.LO]

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