Institute for Mathematical Sciences                                        Programs & Activities

 

   
 

Online registration form
    Register


Enquiries

      General

      Scientific aspects




   

Ninth International Conference on Computability,
Complexity and Randomness (CCR 2014)
(9 - 13 Jun 2014)

Venue: IMS Auditorium

Organizing Committee · Visitors and Participants · Overview · Activities · Venue

 

Monday, 9 Jun 2014

08:45am - 09:00am

Registration

09:00am - 09:15am

Opening Remarks

09:15am - 10:00am

Relating and contrasting plain and prefix Kolmogorov complexity (PDF)
Bruno Bauwens, Universite de Lorraine, France

10:00am - 10:45am

Finite state incompressible infinite sequences (PDF)
Cristian Sorin Calude, The University of Auckland, New Zealand

10:45am - 11:15am

--- Group Photo & Coffee Break ---

11:15am - 12:00nn

An introduction to provability degrees (PDF)
Mingzhong Cai, University of Wisconsin-Madison, USA

12.00nn - 02:00pm

--- Lunch ---

02:00pm - 02:45pm

Applications of algorithmic complexity to network science and synthetic biology (PDF)
Hector Zenil, Karolinska Institutet, Sweden

02:45pm - 03:30pm

Degrees of members of thin classes (PDF)
Guohua Wu, Nanyang Technological University, Singapore

03:30pm - 04:00pm

--- Coffee Break ---

04:00pm - 04:45pm

Finite automorphism bases for degree structures (PDF)
Mariya Ivanova Soskova, University of California, Berkeley, USA

04:45pm - 05:30pm

Reformulating quantum mechanics by algorithmic randomness
Kohtaro Tadaki, Chuo University, Japan

Tuesday, 10 Jun 2014

09:00am - 09:15am

Registration

09:15am - 10:00am

On limitations of the Ehrenfeucht-Fraisse-method in descriptive complexity (PDF)
Yijia Chen, Shanghai Jiao Tong University, China

10:00am - 10:45am

Computations with incomplete or imperfect information (PDF)
Gregory Igusa, University of Notre Dame, USA

10:45am - 11:15am

--- Coffee Break ---

11:15am - 12:00nn

Layerwise computable mappings and computable Lovasz local lemma (PDF)
Alexander Shen, LIRMM CNRS, France

12.00nn - 02:00pm

--- Lunch ---

02:00pm - 02:45pm

Mathias forcing
Peter Cholak, University of Notre Dame, USA

02:45pm - 03:30pm

The uniformly non-low2 c.e. degrees and the cl-reducibility (PDF)
Yun Fan, Southeast Univerisity, China

03:30pm - 04:00pm

--- Coffee Break ---

04:00pm - 04:45pm

From randomness to order (PDF)
Georgios Barmpalias, Chinese Academy of Sciences, China and Victoria University of Wellington, New Zealand

04:45pm - 05:30pm

Randomness for capacities with applications to random closed sets (PDF)
Jason Rute, Pennsylvania State University, USA

Wednesday, 11 Jun 2014

09:00am - 09:15am

Registration

09:15am - 10:00am

The complexity of n11 randomness (PDF)
Noam Greenberg, Victoria University of Wellington, New Zealand

10:00am - 10:45am

Triviality within and beyond hyperarithmetic (PDF)
Takayuki Kihara, Japan Advanced Institute of Science and Technology, Japan

10:45am - 11:15am

--- Coffee Break ---

11:15am - 12:00nn

Infinite time computations and randomness (PDF)
Philipp Schlicht, University of Bonn, Germany

12.00nn - 02:00pm

--- Lunch Reception at IMS ---

Thursday, 12 Jun 2014

09:00am - 09:15am

Registration

09:15am - 10:00am

On Rogers semilattices of analytical hierarchy (PDF)
Marina Dorzhieva, Novosibirsk State University, Russia

10:00am - 10:45am

Ornstein isomorphism and algorithmic randomness (PDF)
Satyadev Nandakumar, Indian Institute of Technology, India

10:45am - 11:15am

--- Coffee Break ---

11:15am - 12:00nn

Integer-valued randomness and degrees (PDF)
Michael McInerney, Victoria University of Wellington, New Zealand

12.00nn - 02:00pm

--- Lunch ---

02:00pm - 02:45pm

An analogy between cardinal characteristics and highness properties of oracles (PDF)
Andre Nies, The University of Auckland, New Zealand

02:45pm - 03:30pm

An effective form of Rademacher's theorem (PDF)
Alex Galicki, The University of Auckland, New Zealand

03:30pm - 04:00pm

--- Coffee Break ---

04:00pm - 04:45pm

On approximate decidability of minimal programs (PDF)
Jason Teutsch, The University of Chicago, USA

04:45pm - 05:30pm

Defining totality in the enumeration degrees (PDF)
Joseph Miller, University of Wisconsin, USA

Friday, 13 Jun 2014

09:00am - 09:15am

Registration

09:15am - 10:00am

Reverse mathematics on Quasi-Riesz spaces (PDF)
Ningning Peng, National University of Singapore

10:00am - 10:45am

Schnorr-randomness versions of K, C, LR, vL-reducibilities (PDF)
Kenshi Miyabe, Meiji University, Japan

10:45am - 11:15am

--- Coffee Break ---

11:15am - 12:00nn

Algorithmically random algebraic structures (PDF)
Bakhadyr Khoussainov, The University of Auckland, New Zealand

12.00nn - 02:00pm

--- Lunch ---

02:00pm - 02:45pm

Cone avoidance and randomness preservation (PDF)
Stephen Simpson, Pennsylvania State University, USA

02:45pm - 03:30pm

Nondeterministic automatic complexity of almost square-free and strongly cube-free words
Bjoern Kjos-Hanssen, University of Hawaii, USA

03:30pm - 04:15pm

Weak lowness notions and weak reducibilities (PDF)
Ian Herbert, National University of Singapore

04:15pm - 04:45pm

--- Coffee Break ---


Organizing Committee · Visitors and Participants · Overview · Activities · Venue

top
Best viewed with IE 7 and above