Algorithmic information properties of points on lines

This talk will present results on the algorithmic randomness and dimension of points on lines in the Euclidean plane and discuss the interplay between geometric notions of size and computational notions of predictability and compressibility. These results are closely tied to questions about Kakeya sets.

About Dr. Neil Lutz

Neil Lutz is a Visiting Assistant Professor of Computer Science at Swarthmore College, a Lecturer in the Department of Computer and Information Science at the University of Pennsylvania, and an Affiliate Assistant Professor of Computer Science at Iowa State University. His research interests include algorithmic information theory, geometric measure theory, and fairness in multi-agent systems. He holds a Ph.D. in Computer Science and an M.S. in Mathematics from Rutgers University, supervised by Rebecca Wright and Michael Saks, respectively. Prior to his current roles, Neil was a postdoctoral researcher at the University of Pennsylvania, where he worked under the supervision of Sampath Kannan.