Calendar

Oct
25
Wed
253A
Oct 25 @ 11:30 am – 12:20 pm
Oct
26
Thu
14.7, 14.8
Oct 26 @ 1:30 pm – Oct 26 @ 2:30 pm
Logic seminar: Borel determinacy IV (David Webb)
Oct 26 @ 2:55 pm – 3:55 pm
Oct
30
Mon
Weeks 11-15 start
Oct 30 all-day
Oct
31
Tue
14.4-6 due
Oct 31 @ 1:30 pm – Oct 31 @ 2:30 pm
14.8, review
Oct 31 @ 1:30 pm – Oct 31 @ 2:30 pm
Nov
1
Wed
253A
Nov 1 @ 11:30 am – 12:20 pm
Nov
2
Thu
15.1
Nov 2 @ 1:30 pm – Nov 2 @ 2:30 pm
Logic Seminar: Borel Determinacy V
Nov 2 @ 2:55 pm – 3:55 pm
Nov
7
Tue
Midterm 2 on Ch. 13 & 14.1-6
Nov 7 @ 1:30 pm – Nov 7 @ 2:30 pm
Nov
8
Wed
253A
Nov 8 @ 11:30 am – 12:20 pm
Nov
9
Thu
15.2
Nov 9 @ 1:30 pm – Nov 9 @ 2:30 pm
Logic seminar: Boreal Determinacy VI (Khan)
Nov 9 @ 2:55 pm – 3:55 pm
Nov
14
Tue
15.3 (Wolfgang Erb)
Nov 14 @ 1:30 pm – Nov 14 @ 2:30 pm
Nov
15
Wed
253A
Nov 15 @ 11:30 am – 12:20 pm
Nov
16
Thu
15.4 (George Wilkens)
Nov 16 @ 1:30 pm – Nov 16 @ 2:30 pm
Nov
21
Tue
14.7-8 and 15.1 due
Nov 21 @ 1:30 pm – Nov 21 @ 2:30 pm
15.2-3 due
Nov 21 @ 1:30 pm – Nov 21 @ 2:30 pm
15.5
Nov 21 @ 1:30 pm – Nov 21 @ 2:30 pm
Nov
22
Wed
253A
Nov 22 @ 11:30 am – 12:20 pm
Nov
28
Tue
15.4-5 due
Nov 28 @ 1:30 pm – Nov 28 @ 2:30 pm
15.6
Nov 28 @ 1:30 pm – Nov 28 @ 2:30 pm
Nov
29
Wed
253A
Nov 29 @ 11:30 am – 12:20 pm
Nov
30
Thu
15.7
Nov 30 @ 1:30 pm – Nov 30 @ 2:30 pm
David Webb’s specialty exam: A new notion of effective dimension @ Keller Hall 402
Nov 30 @ 2:50 pm – 3:40 pm

David Webb will present a new notion of effective dimension, inescapable dimension, which is in a sense dual to complex packing dimension.

The latter was introduced by Freer and Kjos-Hanssen in 2013 in the context of trying to show that the reals of effective Hausdorff dimension 1 are not Medvedev above the bi-immune sets.

Webb will show that the two notions are incomparable, among other results.

Dec
5
Tue
15.6-8 due
Dec 5 @ 1:30 pm – Dec 5 @ 2:30 pm
15.8
Dec 5 @ 1:30 pm – Dec 5 @ 2:30 pm
Dec
6
Wed
253A
Dec 6 @ 11:30 am – 12:20 pm
Dec
7
Thu
Review
Dec 7 @ 1:30 pm – Dec 7 @ 2:30 pm
Joint Analysis/Logic Seminar @ Keller 402
Dec 7 @ 2:55 pm – 3:45 pm

Speaker : Michael Yampolsky (University of Toronto)

Title : Computability of Julia sets.

Abstract : Informally speaking, a compact set in the plane is computable if there exists an algorithm to draw it on a computer screen with an arbitrary resolution. Julia sets are some of the best-known mathematical images, however, the questions of their computability and computational complexity are surprisingly subtle. I will survey joint results with M. Braverman and others on computability and complexity of Julia sets.