Presenter: Jennifer Chubb from University of San Francisco

An infinite graph - one made of nodes and edges - is computable if there is an algorithm that can decide whether or not a given pair of nodes is connected by an edge. For example, the internet is a computable graph which is, for all intents and purposes, infinite. Explore the topic of computable graphs with Jennifer Chubb.