PSU Mark
Eberly College of Science Mathematics Department

Meeting Details

For more information about this meeting, contact Stephen Simpson.

Title:Introduction to Kolmogorov complexity and effective Hausdorff dimension
Seminar:Logic Seminar
Speaker:Phil Hudelson, Pennsylvania State University
The Kolmogorov complexity of a finite sequence of 0's and 1's is the length of the shortest algorithm which computes the given sequence. Hausdorff dimension is a generalization of the idea of dimension in vector spaces. In this talk we will introduce Kolmogorov complexity and an effective version of Hausdorff dimension, and prove a surprising connection between these two concepts.

Room Reservation Information

Room Number:MB315
Date:09 / 07 / 2010
Time:02:30pm - 03:45pm