BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen - ECPv5.7.0//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen
X-ORIGINAL-URL:https://www.greyc.fr
X-WR-CALDESC:évènements pour GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20250330T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20251026T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20250121T104500
DTEND;TZID=Europe/Paris:20250121T114500
DTSTAMP:20260421T173320
CREATED:20250121T085857Z
LAST-MODIFIED:20250121T085937Z
UID:11772-1737456300-1737459900@www.greyc.fr
SUMMARY:Séminaire Algorithmique : Djamel Eddine Amir (LISN\, Univ. Paris-Saclay) « Computability of Compact Spaces »
DESCRIPTION:The topological properties of a set have a strong impact on its computability properties. A striking illustration of this idea is given by spheres\, closed manifolds and finite graphs without endpoints: if a set X is homeomorphic to a sphere\, a closed manifold or such a graph\, then any algorithm that semicomputes X in some sense can be converted into an algorithm that fully computes X. In other words\, the topological properties of X enable one to derive full information about X from partial information about X. In that case\, we say that X has computable type. Those results have been obtained by Miller and Iljazović and others in recent years. We give a characterization of finite simplicial complexes having computable type using a local property of stars of vertices. We argue that the stronger\, relativized version of computable type\, is better behaved. Consequently\, we obtain characterizations of strong computable type\, related to the descriptive complexity of topological invariants. We study two families of topological invariants of low descriptive complexity\, expressing the extensibility and the null-homotopy of continuous functions. We apply the theory to revisit previous results and obtain new ones. This leads us to investigate the expressive power of low complexity invariants in the Borel hierarchy and their ability to differentiate between spaces. Notably\, we show that they are sufficient for distinguishing finite topological graphs.
URL:https://www.greyc.fr/event/seminaire-algorithmique-djamel-eddine-amir-lisn-univ-paris-saclay-computability-of-compact-spaces/
LOCATION:Sciences 3- S3 351
CATEGORIES:Amacc,General,News,Séminaire Algo
END:VEVENT
END:VCALENDAR