Computability Learning SeminarExport this event to calendar

Wednesday, February 24, 2016 — 3:30 PM EST

Michael Deveau, Department of Pure Mathematics, University of Waterloo

“Bases for ML-Randomness - Part 2”

We briefly discuss the construction presented last time, which proves that each base for ML-randomness is low for K, and then verify that the construction works as claimed. We then use this result to prove an important corollary. Time permitting, we begin a discussion about lowness pairs.

MC 5403

S M T W T F S
29
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
  1. 2022 (98)
    1. August (8)
    2. July (15)
    3. June (14)
    4. May (13)
    5. April (14)
    6. March (15)
    7. February (12)
    8. January (7)
  2. 2021 (135)
    1. December (11)
    2. November (22)
    3. October (15)
    4. September (5)
    5. August (15)
    6. July (17)
    7. June (15)
    8. May (1)
    9. April (4)
    10. March (11)
    11. February (9)
    12. January (10)
  3. 2020 (103)
  4. 2019 (199)
  5. 2018 (212)
  6. 2017 (281)
  7. 2016 (335)
  8. 2015 (211)
  9. 2014 (235)
  10. 2013 (251)
  11. 2012 (135)