[FOM] Fwd: Randomness

[Lksh Munen]

---------- Forwarded message ----------
From: Kreinovich, Vladik <vladik at utep.edu>
Date: Jan 25, 2008 3:01 AM
Subject: [KC-List] FW: Randomness
To: kolmogorov at idsia.ch
Cc: Douglas Cenzer <cenzer at math.ufl.edu>


 forwarding. Vladik

-----Original Message-----
>From Douglas Cenzer

First Announcement

The Algorithmic Randomness Graduate Workshop and Tutorial will take
place
June 9--June 20 at the University of Florida in Gainesville.

Tutorials will be given by John Hitchcock (Wyoming), Andre Nies
(Auckland, New
Zealand) and Jan Reimann (UC Berkeley).  They will be accessible to
graduate
students and non-specialists. A brief outline is given below.

There will also be lectures on current research.
Please let me know if you would like to participate or to give a talk.

The goal of the workshop is to encourage and prepare graduate students
in mathematics and  computer science for research in algorithmic
randomness.

Partial support for travel and lodging expenses of graduate students in
partiuclar is provided through the National Science Foundation
Focused Research Group Award; it is anticipated that lodging will
covered.
Please send a request for support to
cenzer at math.ufl.edu and ask your graduate advisor to send a brief letter
of recommendation as well.

Watch for the conference web page at
<http://www.math.ufl.edu/~cenzer>

BRIEF OUTLINE OF TUTORIALS

Reimann: Introduction to Algorithmic Randomness:
--Three approaches to effective randomness: game theoretic
(martingales), measure theoretic (Martin-Loef tests), information
theoretic (incompressibility, Kolmogorov complexity); Schnorr's theorem
--computational properties and complexity of random sequences, Pi01
classes;
-- extracting information from random sequences, Kucera-Gacs Theorem
-- c.e. reals, Chaitin\'s Omega, Kucera-Slaman theorem
-- relative randomness, van-Lambalgen's theorem

Nies: Lowness properties related to randomness

Hitchcock:  Randomness in computational
complexity, focusing on resource-bounded measure, dimension, and
Kolmogorov complexity.

--Doug Cenzer for the organizing committee.



Office address: Prof. Douglas Cenzer
                Archive for Mathematical Logic
                Department of Mathematics
                358 Little Hall
                PO Box 118105
                University of Florida
                Gainesville, FL 32611-8105  USA
Office Phone:   (352) 392-0281 ext 262
Office Fax:     (352) 392-8357
www home page:  http://www.math.ufl.edu/~cenzer
e-mail:         cenzer at math.ufl.edu

_______________________________________________
Kolmogorov mailing list
Kolmogorov at idsia.ch
http://mailman.ti-edu.ch/mailman/listinfo/kolmogorov