2017/10/04 by Noson S. Yanofsky, Yanofsky, Noson S. · 1 voice
Computer Science · Mathematics · #Computability, Logic, AI Algorithms #Distributed and Parallel Computing Systems #Homotopy and Cohomology in Algebraic Topology #cs.CC #cs.LO #math.CT
paper · pdf · doi:10.48550/arxiv.1710.03090
openalex publication_date 2017/10/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Theoretical computer science discusses foundational issues about computations. It asks and answers questions such as "What is a computation?", "What is computable?", "What is efficiently computable?","What is information?", "What is random?", "What is an algorithm?", etc. We will present many of the major themes and theorems with the basic language of category theory. Surprisingly, many interesting theorems and concepts of theoretical computer science are easy consequences of functoriality and composition when you look at the right categories and functors connecting them.