[Colloquium] Denis Hirschfeldt on October 1st, 2004
Margery Ishmael
marge at cs.uchicago.edu
Tue Sep 21 11:32:56 CDT 2004
DEPARTMENT OF COMPUTER SCIENCE - TALK
Date: Friday, October 1st, 2004
Time: 2:30 p.m.
Place: Ryerson 251
-------------------------------------------
Speaker: DENIS HIRSCHFELDT
From: The University of Chicago, Department of Mathematics
Url: http://www.math.uchicago.edu/~drh/
Title: Computability, Kolmogorov complexity, and randomness
Abstract:
By using a definition of computable randomness based on Kolmogorov
complexity, it is possible to refine the random/nonrandom dichotomy,
creating structures that measure the computable randomness of one
infinite sequence in relation to another. I will introduce the basics
of the theory of relative randomness and discuss some recent results,
including the discovery of a natural class of "far from random"
sequences with highly appealing properties.
-------------------------------------------------------
Host: Prof. ROBERT SOARE
*Refreshments will follow the talk in Ryerson 255*
People in need of assistance should call 773-834-8977 in advance.
More information about the Colloquium
mailing list