Math Colloquium: Distance Functions On Computable Graphs

Date
Feb 16, 2022 , 4:00pm - 5:00pm
Location
Zoom
Event Categories

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.

JOIN ON ZOOM

Math Graphics
Forward to Friends
Date
February 16, 2022
Add to Calendar