Collection
Topological Methods in Computer Science
The last two decades have witnessed a fruitful interplay between certain qualitative ideas and methods from geometric and topological areas on one side and from aspects of theoretical computer science on the other. Simplicial and cubical models in distributed computing and in concurrency theory are amenable to investigations using methods from algebraic topology – with a twist! Similar developments have emerged with point of departure in logics and rewriting, often through the lens of higher category theory and/or connected to Homotopy Type Theory. In a different line of research, the analysis and investigation of (hybrid variants of) control systems and robotics profit from developments in classical and combinatorial versions of Conley and Morse theory. Moreover, topological methods significantly contributed to the emergence of rigorous numerics as part of computer science with fundamental implications for control problems. It turns out that quite different aspects and topics from Computer Science lead to similar models and lines of topological investigations.
Editors
-
Éric Goubault (Guest Editor)
Professor, École Polytechnique Paris, France
-
Marian Mrozek (Guest Editor)
Professor, Jagiellonian University, Krakow, Poland
-
Martin Raussen (APCT Editor)
Professor, Aalborg University, Denmark
