Wednesday, September 30, 2015

Wednesday, September 30, 2015 — 2:30 PM EDT

Jason Bell, Pure Mathematics, University of Waterloo

"The noncommutative Zariski Cancellation Problem"

Wednesday, September 30, 2015 — 3:30 PM EDT

Mohammad Mahmoud, Pure Mathematics, University of Waterloo

"Algorithmic Randomness: Introduction to Kolmogorov Complexity"

Last time we saw why the Kolmogorov complexity $K$ can be better than the plain complexity $C$ as it is subadditive and complexity doesn't dip. This time we are going to see more properties showing that $K$ matches our intuition. More precisely, (a) Incompressible (in the sense of $K$) strings have only short runs of zeros (i.e. blocks only consisting of zeros), and (b) Zeros and ones occur balancedly.

MC 5403

S M T W T F S
30
31
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
1
2
3
  1. 2020 (22)
    1. January (22)
  2. 2019 (199)
    1. December (7)
    2. November (26)
    3. October (19)
    4. September (13)
    5. August (7)
    6. July (12)
    7. June (18)
    8. May (22)
    9. April (11)
    10. March (25)
    11. February (17)
    12. January (22)
  3. 2018 (219)
  4. 2017 (281)
  5. 2016 (335)
  6. 2015 (209)
    1. December (7)
    2. November (39)
    3. October (38)
    4. September (15)
    5. August (10)
    6. July (18)
    7. June (24)
    8. May (12)
    9. April (2)
    10. March (27)
    11. January (17)
  7. 2014 (235)
  8. 2013 (251)
  9. 2012 (135)