PSU Mark
Eberly College of Science Mathematics Department

Meeting Details

For more information about this meeting, contact Jason Rute, Stephen Simpson, Jan Reimann.

Title:Kolmogorov Random Graphs
Seminar:Logic Seminar
Speaker:John Pardo, Penn State
We will discuss several properties of Kolmogorov random graphs using deficiency functions, i.e. functions that bound how far away a graph is from maximum complexity, and relate these properties back to the usual notion of randomness for binary strings as well as connect them to the property of quasirandomness.

Room Reservation Information

Room Number:MB315
Date:03 / 03 / 2015
Time:02:30pm - 03:45pm