Skip to content
Search events. View events.
 

All Categories

Submit Events
Click for help in using calendar displays. Print the contents of the current screen.

Advanced Search

(New Search)

Submit
Event Details
Add this event to my personal calendar.
Go Back
Math/Stat Colloquium
Start Date: 4/12/2016Start Time: 4:15 PM
End Date: 4/12/2016End Time: 5:30 PM

Event Description:
Karen Lange '02 Wellesley College Title: Climbing (or Finding Paths) through Trees Abstract: You can make a simple family tree by starting with a person at the root and then adding two branches for her parents, and then adding two branches for the parents of each of her two parents, and so on. Such a family tree is an example of a binary tree because each level of the tree has at most two branches. We'll see that every binary tree with infinitely many nodes has an infinite path. But can we actually *compute* a path, given that we can prove one exists? Answering this question requires us to carefully define the verb "to compute". Moreover, we will see how path-finding can be used to solve a seemingly unrelated map coloring problem (hinting at the computational power of finding paths!).

This talk will highlight ideas from graph theory, theoretical computer science, and logic, but no background in any of these subjects is necessary.

Refreshments: 4:15pm, Talk 4:30pm
Location Information:
*Swarthmore College  (View Map)
500 College Avenue
Swarthmore, PA 19081

*Swarthmore College - Science Center
Room: Science Center 199 - Cunniff Hall
Contact Information:
Name: Linda Chen
Phone: 328-8246
Email: lchen@swarthmore.edu
Lange
Open To
The Public

Calendar Software powered by Active Calendar and Active Data Calendar   
Select item(s) to Search
Select item(s) to Search
Select item(s) to Search
Select item(s) to Search