Additive Cellular Automata Graded-Monadically

Explore the concept of cellular automata from a graded comonadic perspective in this 34-minute conference talk presented at ACM SIGPLAN. Delve into the research of Silvio Capobianco and Tarmo Uustalu as they demonstrate how cellular automata, traditionally viewed as a comonadic notion of computation, can be understood through a graded comonadic lens. Discover how this new perspective offers more informative and fundamental insights. Examine the case of additive cellular automata, which uniquely allows for both graded comonadic and graded monadic interpretations. Learn about the graded version of Kleiner's observation on adjoint comonad-monad pairs, which enables this dual perspective in the special case of additive cellular automata.