For more information about this meeting, contact Stephen Simpson.
| Title: | Kolmogorov complexity and geometric measure theory |
|---|
| Seminar: | Logic Seminar |
|---|
| Speaker: | Jan Reimann, Pennsylvania State University |
|---|
| Abstract: |
|---|
| We study two central results of geometric measure theory - Frostman's
Lemma and the existence of subsets of finite measure - from a
computability theoretic view. We use computability theoretic methods
to give a new proof of Frostman's Lemma and use it to prove a collapse
of randomness notions. Furthermore, we will study the Muchnik degrees
related to subsets of finite Hausdorff measure of a given Borel set. |
Room Reservation Information
| Room Number: | MB315 |
|---|
| Date: | 09 / 14 / 2010 |
|---|
| Time: | 02:30pm - 03:45pm |
|---|
