Registration is now open! Please fill out the online registration form if you plan to attend. The schedule of talks and list of abstracts will be posted here as they become available.
| Description |
|---|
In addition to student presentations, the conference features two invited faculty
plenary talks, a panel on career opportunities in government, industry, and academia, networking opportunities at lunch (provided to all participants) and a drawing for door prizes at the end.
| Information |
|---|
Location: 7800 York Road, on the campus of Towson University in Towson Maryland.
Time: 10:00 AM - 5:30 PM
Registration starts at 9:30am, along with coffee and pastry refreshments.
Free lunch provided for all registered participants. Stay until after the final plenary talk for a chance to win one of 5 door prizes (including board games and, like every year, a flying drone!)
Please fill out the online registration form if you are planning to attend.
Organizers: Sergiy Borodachov (sborodachov@towson.edu), Alexei Kolesnikov (akolesnikov@towson.edu), Nathan McNew (nmcnew@towson.edu)
| Plenary Speakers |
|---|
Title: Climbing (or Finding Paths) through Trees: Computing the difficulty of mathematical problems
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; this result is called Weak Kőnig's Lemma. But just because we know a path exists, doesn't mean we can find it. Given Weak Kőnig's Lemma, it's natural to ask whether we can compute a path through a given binary tree with infinitely many nodes. It turns out the answer to this "Path Problem" is "no", so we say that the problem is not "computable". But then what exactly is the computational power of this Path Problem?
Using the Path Problem as a test case, we will explore the key ideas behind taking a "computable" perspective on mathematics (over an "existence" one) and describe an approach for measuring the computational power of mathematical problems. We'll see that the computational power of problems varies widely and studying problems' power helps to illuminate what really makes problems "tick".
This talk will highlight ideas from graph theory, theoretical computer science, and logic, but no background in any of these subjects is necessary.
Plenary Speaker 2: To be announced.
| Contributed Talks |
|---|
| Career Panel |
|---|
| Logistics |
|---|
Parts of the conference may also be available on Zoom. Links to participate will be emailed to registered participants.
Last modified 1 August 2026.