DeepAI
Log In Sign Up

Theoretical Computer Science for the Working Category Theorist

10/04/2017
by   Noson S. Yanofsky, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

08/02/2022

Mary Kenneth Keller: First US PhD in Computer Science

The first two doctoral-level degrees in Computer Science in the US were ...
06/11/2019

The Halting Paradox

The halting problem is considered to be an essential part of the theoret...
07/06/2021

Visions in Theoretical Computer Science: A Report on the TCS Visioning Workshop 2020

Theoretical computer science (TCS) is a subdiscipline of computer scienc...
07/30/2018

Who needs category theory?

In computer science, category theory remains a contentious issue, with e...
07/05/2017

The Complexity of Human Computation: A Concrete Model with an Application to Passwords

What can humans compute in their heads? We are thinking of a variety of ...