PSU Mark
Eberly College of Science Mathematics Department

Meeting Details

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

Title:The power of uniformity in algorithmic randomness
Seminar:Logic Seminar
Speaker:Jason Rute, Penn State
It is well known that computable analysis and algorithmic randomness are closely connected. Moreover, computable analysis suggests that uniform reducibility should play a large role in algorithmic randomness. In this talk I will show an application of this insight. I will prove a product theorem for Schnorr randomness for non-computable measures. This product theorem is an extension of van Lambalgen's well-known theorem. Both the proof and the statement of the theorem rely heavily on uniformity. It also uses computable analysis in important and insightful ways.

Room Reservation Information

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