Graduate Programs
Graduate Home
Ph D Programs
Masters Degree
Ph D Program Requirements
Course Descriptions
Current Courses
Admissions
Current Graduate Students
Graduate Student Seminar
SIAM Chapter Seminar
Recent Graduates
Incoming Students

Graduate Seminar
Jing Zhang Carnegie Mellon University Title: The Use of "Almost Everywhere" Theorems in Algorithmic Randomness Abstract: Algorithmic Randomness is a rapidly evolving field, with input from information theory, recursion theory, complexity theory and computable analysis. Recent progress in effectivizing "almost everywhere" theorems in analysis turns out fruitful in that not only does it shed light on some major open problems but it also increases the understanding of the big randomness structure. This talk will focus on the notion "density randomenss" with motivation from the major open problem "randomness covering problem". Date: Tuesday, September 9, 2014 Time: 5:30 pm Location: Wean Hall 8220 Submitted by: Zilin Jiang 