Atlas home || Conferences | Abstracts | about Atlas

Conference on Computability, Complexity and Randomness
May 19-23, 2008
Institute of Mathematical Science, Nanjing University.
Nanjing, JiangSu Province, P. R. of China

Organizers
Verónica Becher (University of Buenos Aires, Argentina), Rod Downey (Victoria University, Wellington, New Zealand), Denis Hirschfeldt (University of Chicago, USA), Jack Lutz (Iowa State University, USA), Wolfgang Merkle (Universität Heidelberg, Germany), Joseph Miller (University of Connecticut, USA), Liang Yu (Nanjing University, China)

Conference Homepage

Abstracts

Invited talks

George Barmpalias New characterizations of K-triviality
CT Chong Hyperimmune-free sets beyond w
Rod Downey Degrees of reals of high packing dimension
Noam Greenberg More on strongly jump-traceable reals
Bjørn Kjos-Hanssen Effective Fourier dimension
Antonin Kucera Diagonalization and randomness
Steffen Lempp Separating notions of randomness
Antonio Montalban On the two quantifier theory of structure of Turing degrees below the Halting Problem.
Jan Reimann Effective Geometric Measure Theory
Stephen G. Simpson Mass problems
Frank Stephan Universal recursively enumerable sets of strings
Xishun Zhao Model Theory and Complexity of Quantified Boolean Formulas

contributed talks

Veronica Becher Randomness related to usual mathematical notions
Peter Cholak Effective Lim Infs in Cantor Space
David Diamondstone A promptly simple set which is not superlow cuppable
Yun fan On the structure of sw-degrees of c.e. reals sets: some observations
Santiago Figueira Indifferent sets
Johanna Franklin van Lambalgen's Theorem and Schnorr randomness
Rupert Hölzl Generation complexity versus distinction complexity
Andre Nies Weak reducibilities
Kohtaro Tadaki Equivalent characterizations of partial randomness for a recursively enumerable real


© 2009 Atlas Conferences Inc.