For more information about this meeting, contact Becky Halpenny.
|Title:||"Computable Analysis and Algorithmic Randomness"|
|Seminar:||Ph.D. Oral Comprehensive Examination|
|Speaker:||Adrian Maler, Adviser: Steve Simpson, Penn State|
|We discuss what it means to do analysis in a computable universe, leading to a foundational question: is there anything about convergence in a metric space that we can compute from a program but not its output alone? Next, we introduce the concept of algorithmic randomness, its basic types and analytic characterizations. We return to the computable universe to identify "random" characteristics of computable reals.|
Room Reservation Information
|Date:||04 / 20 / 2012|
|Time:||02:00pm - 03:30pm|