Oberseminar

Die Vorträge sind üblicherweise dienstags um 16 Uhr c.t. in Raum 134 des Gebäudes INF 294.
(The talks are usually on Tuesday at 4 p.m. in Room 134 of building INF 294.)


Die Seite befindet sich im Aufbau

 

Vorträge

19. April 2011, 16 Uhr c.t., HS 134, AM

Liang Yu, Nanjing University
Characterizing nonstandard randomness notions via Martin-Lof randomness


10. Mai 2011, 16 Uhr c.t., HS 134, AM

Jan Reimann, Penn State University
Algorithmic independence and PA Degrees

 

31. Mai 2011, 16 Uhr c.t., HS 134, AM

Philipp Bodewig, Universität Heidelberg
Embedding Finite Lattices into the C.E. ibT- and cl-Degrees

 

5. Juli 2011, 16 Uhr c.t., HS 134, AM

Iskander Kalimullin, Kazan University
Structures with no degree of categoricity

 

 


 




19. April 2011

Characterizing nonstandard randomness notions via Martin-Lof randomness

We introduce two methods to characterize nonstandard randomness notions via Martin-Löf randomness. By applying these methods, we investigate 0'-Schnorr randomness.

10. Mai 2011

Algorithmic independence and PA Degrees

In joint work with Adam Day, we study the question of when two reals A,B are independent with respect to their mutual information. We interpret the question rather qualitatively and ask whether there exists a probability measure mu such that A and B are relatively mu-random. We prove a general version of Van Lambalgen's Theorem and use it reduce the question to randomness for product measures. We will exhibit rather strong obstacles for r.e. sets to be random for product measures, and apply it to obtain new results on PA degrees.

31. Mai 2011

Embedding Finite Lattices into the C.E. ibT- and cl-Degrees

We give an overview of known results about the embeddability of finite lattices into the c.e. ibT- and cl-degrees. In particular, we will discuss two proofs by Ambos-Spies, Bodewig, Kräling and Yu and Ambos-Spies, Bodewig, Kräling and Wang, respectively, that describe how to