Calendar

3 Sun 4 Mon 5 Tue 6 Wed 7 Thu 8 Fri 9 Sat
All-day
CCR 2016
CCR 2016
Jan 4 – Jan 8 all-day
CCR 2016
The 11th International Conference on Computability, Complexity and Randomness is held in Physical Science Building 217, University of Hawaii at Manoa, January 4–8, 2016. The conference is supported by the National Science Foundation under Grant[...]
CCR 2016
CCR 2016
Jan 4 – Jan 8 all-day
CCR 2016
The 11th International Conference on Computability, Complexity and Randomness is held in Physical Science Building 217, University of Hawaii at Manoa, January 4–8, 2016. The conference is supported by the National Science Foundation under Grant[...]
CCR 2016
CCR 2016
Jan 4 – Jan 8 all-day
CCR 2016
The 11th International Conference on Computability, Complexity and Randomness is held in Physical Science Building 217, University of Hawaii at Manoa, January 4–8, 2016. The conference is supported by the National Science Foundation under Grant[...]
CCR 2016
CCR 2016
Jan 4 – Jan 8 all-day
CCR 2016
The 11th International Conference on Computability, Complexity and Randomness is held in Physical Science Building 217, University of Hawaii at Manoa, January 4–8, 2016. The conference is supported by the National Science Foundation under Grant[...]
CCR 2016
CCR 2016
Jan 4 – Jan 8 all-day
CCR 2016
The 11th International Conference on Computability, Complexity and Randomness is held in Physical Science Building 217, University of Hawaii at Manoa, January 4–8, 2016. The conference is supported by the National Science Foundation under Grant[...]
12:00 am
1:00 am
2:00 am
3:00 am
4:00 am
5:00 am
6:00 am
7:00 am
8:00 am
9:00 am
10:00 am
11:00 am
12:00 pm
1:00 pm
2:00 pm
3:00 pm
4:00 pm
5:00 pm
6:00 pm
7:00 pm
8:00 pm
9:00 pm
10:00 pm
11:00 pm
9:45 am Opening of CCR 2016
Opening of CCR 2016
Jan 4 @ 9:45 am – 9:50 am
Opening of CCR 2016
Opening remarks 9:45 Erik Guentner (mathematics department chair) 9:46 Rod Downey (PC chair) 9:48 Bjørn Kjos-Hanssen (organizer) The dinner is at Lulu’s at 6pm at the intersection of Kapahulu and Kalakaua. Note the change since[...]
9:50 am Linda Brown Westrick
Linda Brown Westrick
Jan 4 @ 9:50 am – 10:40 am
Linda Brown Westrick
Speaker: Linda Brown Westrick. Title: Seas of squares with sizes from a co-enumerable set Slides Abstract: Three prominent classes of two-dimensional subshifts are the shifts of finite type (SFTs), the sofic shifts, and the effectively[...]
10:40 am Coffee break
Coffee break
Jan 4 @ 10:40 am – 11:40 am
Coffee break
11:10 am Valentina Harizanov
Valentina Harizanov
Jan 4 @ 11:10 am – 11:40 am
Valentina Harizanov
Title: Degrees of the isomorphism types of structures Slides The Turing degree spectrum of a countable structure $A$ is the set of all Turing degrees of the isomorphic copies of $A$. Knight proved that the[...]
11:40 am Jake Pardo
Jake Pardo
Jan 4 @ 11:40 am – 12:10 pm
Jake Pardo
Title: Gambling against some odds
12:00 pm Lunch break
Lunch break
Jan 4 @ 12:00 pm – Jan 4 @ 2:00 pm
Lunch break
2:00 pm Lance Fortnow: Tutorial I
Lance Fortnow: Tutorial I
Jan 4 @ 2:00 pm – 2:50 pm
Lance Fortnow: Tutorial I
Title: Bounding rationality with computation
2:50 pm Adam Case
Adam Case
Jan 4 @ 2:50 pm – 3:20 pm
Adam Case
Title: Turing Reductions and Data Processing Inequalities for Sequences
3:50 pm Hayato Takahashi
Hayato Takahashi
Jan 4 @ 3:50 pm – 4:20 pm
Hayato Takahashi
9:10 am Uri Andrews
Uri Andrews
Jan 5 @ 9:10 am – 10:00 am
Uri Andrews
Title: TBA
10:00 am Coffee break
Coffee break
Jan 5 @ 10:00 am – 10:30 am
Coffee break
10:30 am Satyadev Nandakumar
Satyadev Nandakumar
Jan 5 @ 10:30 am – 11:30 am
Satyadev Nandakumar
Title: Pseudorandomness and dimension
11:30 am Rod Downey
Rod Downey
Jan 5 @ 11:30 am – 12:00 pm
Rod Downey
Title: A minimal degree computable from a weakly 2-generic one Slides
12:00 pm Lunch break
Lunch break
Jan 5 @ 12:00 pm – Jan 5 @ 2:00 pm
Lunch break
2:00 pm Lance Fortnow: Tutorial II
Lance Fortnow: Tutorial II
Jan 5 @ 2:00 pm – 2:50 pm
Lance Fortnow: Tutorial II
Title: Bounding rationality with computation
2:50 pm Jeffrey Shallit
Jeffrey Shallit
Jan 5 @ 2:50 pm – 3:40 pm
Jeffrey Shallit
Title: Separating words using automata
9:10 am Cristobal Rojas
Cristobal Rojas
Jan 6 @ 9:10 am – 10:00 am
Cristobal Rojas
Title: Computability and complexity of random perturbations of dynamical systems
10:00 am Coffee break
Coffee break
Jan 6 @ 10:00 am – 10:30 am
Coffee break
10:30 am Benoit Monin
Benoit Monin
Jan 6 @ 10:30 am – 11:00 am
Benoit Monin
Title: TBA
11:00 am Greg Igusa
Greg Igusa
Jan 6 @ 11:00 am – 11:30 am
Greg Igusa
Title: Generic computability and coarse computability Joint work with Peter Cholak and Rod Downey.
11:30 am Lance Fortnow: Tutorial III
Lance Fortnow: Tutorial III
Jan 6 @ 11:30 am – 12:20 pm
Lance Fortnow: Tutorial III
Title: Bounding rationality with computation
12:20 pm Free afternoon
Free afternoon
Jan 6 @ 12:20 pm – 1:20 pm
Free afternoon
3:30 pm Colloquium: Alexander Volberg (Michigan State) @ Keller 401
Colloquium: Alexander Volberg (M... @ Keller 401
Jan 6 @ 3:30 pm – 4:30 pm
Speaker: Alexander Volberg (Michigan State) Title: Non-homogeneous harmonic analysis, Geometric Measure Theory and fine structures of harmonic measure One of the goals of harmonies analysis is to study singular integrals. Singular integrals are ubiquitous objects[...]
9:10 am Ron Peretz
Ron Peretz
Jan 7 @ 9:10 am – 10:00 am
Ron Peretz
Title: Effective martingales with restricted wagers Slides
10:00 am Coffee break
Coffee break
Jan 7 @ 10:00 am – 10:30 am
Coffee break
10:30 am Rutger Kuyper
Rutger Kuyper
Jan 7 @ 10:30 am – 11:00 am
Rutger Kuyper
Title: Preservation of randomness and genericity under symmetric differences Abstract: Title: Preservation of randomness and genericity under symmetric differences Abstract: Given a class $\mathcal U$ of subsets of the natural numbers, let us say that[...]
11:30 am Wolfgang Merkle
Wolfgang Merkle
Jan 7 @ 11:30 am – 12:00 pm
Wolfgang Merkle
Title: Being low for $\mathrm{K}$ along sequences and elsewhere Slides Abstract: Given a set $D$ of strings, say a sequence $X$ is low for prefix-free Kolmogorov complexity $\mathrm{K}$ on $D$ in case access to $X$[...]
12:00 pm Lunch break
Lunch break
Jan 7 @ 12:00 pm – Jan 7 @ 2:00 pm
Lunch break
2:00 pm Rupert Hölzl
Rupert Hölzl
Jan 7 @ 2:00 pm – 2:30 pm
Rupert Hölzl
Title: Randomness for Computable Measures and Initial Segment Complexity Slides Joint work with Christopher P. Porter.
2:30 pm Dan Turetsky
Dan Turetsky
Jan 7 @ 2:30 pm – 3:20 pm
Dan Turetsky
Title: The complexity of free abelian groups Slides Abstract: Vector spaces are defined by a set of first-order axioms; the theorem every vector space has a basis is second-order, but is a consequence of these[...]
3:50 pm Mariya Soskova
Mariya Soskova
Jan 7 @ 3:50 pm – 4:20 pm
Mariya Soskova
9:30 am Andrew Bridy
Andrew Bridy
Jan 8 @ 9:30 am – 10:00 am
Andrew Bridy
Title: Automatic sequences and curves over finite fields Abstract: A theorem of Christol states that a power series $y$ over the finite field $\mathbb{F}_q$ is an algebraic function if and only if its coefficient sequence[...]
10:00 am Kohtaro Tadaki
Kohtaro Tadaki
Jan 8 @ 10:00 am – 10:30 am
Kohtaro Tadaki
Title: The Principle of Typicality Abstract: This is a sequel to our presentation at CCR 2014. The notion of probability plays a crucial role in quantum mechanics. It appears as the Born rule. In modern[...]
10:30 am Coffee break
Coffee break
Jan 8 @ 10:30 am – 11:00 am
Coffee break
11:00 am Lance Fortnow: Public talk
Lance Fortnow: Public talk
Jan 8 @ 11:00 am – 11:50 am
Lance Fortnow: Public talk
Title: Bounding rationality with computation
11:50 am Group photo
Group photo
Jan 8 @ 11:50 am – 12:20 pm
Group photo
12:20 pm Sandwiches; CCR 2016 ends
Sandwiches; CCR 2016 ends
Jan 8 @ 12:20 pm – 1:20 pm
Sandwiches; CCR 2016 ends