Computability Learning SeminarExport this event to calendar

Wednesday, March 16, 2016 — 3:30 PM EDT

Mohammad Mahmoud, Department of Pure Mathematics, University of Waterloo

“Number of K-creative sets”

Last time we have seen an upper bound on the number of K-trivial sets via some constant b. This week we compute a lower bound which as we will see is also a ”tight” bound (close to the exact number).

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
1
2
3
4
  1. 2023 (43)
    1. February (16)
    2. January (27)
  2. 2022 (179)
    1. December (8)
    2. November (31)
    3. October (24)
    4. September (17)
    5. August (9)
    6. July (15)
    7. June (14)
    8. May (13)
    9. April (14)
    10. March (15)
    11. February (12)
    12. January (7)
  3. 2021 (135)
  4. 2020 (103)
  5. 2019 (199)
  6. 2018 (212)
  7. 2017 (281)
  8. 2016 (335)
  9. 2015 (211)
  10. 2014 (235)
  11. 2013 (251)
  12. 2012 (135)