Computability Learning SeminarExport this event to calendar

Wednesday, June 1, 2016 — 10:00 AM EDT

Jonathan Stephenson, Department of Pure Mathematics, University of Waterloo

“The Decanter Method”

We have previously introduced several different notions of lowness related to complexity which a real number can possess. Amongst these notions were lowness for K, lowness for Martin-Lof randomness, and being a base for Martin-Lof randomness. We showed that these notions are all equivalent, and introduced a fourth notion, K-triviality. We saw that the three equivalent notions each imply K-triviality.

Our main goal is now to prove that all four of the notions are equivalent, which we will achieve by showing that every K-trivial set is low for K. This requires the use of the decanter method, as well as the golden run construction.

The semimar will focus on introducing the ideas needed for the decanter method. We will do so incrementally, giving proofs of increasingly strong results as we do so. In our first proof, we will only show that a K-trivial set cannot be wtt-complete, and in our second, that it cannot be Turing complete either.

In future seminars, we will refine the method further by introducing the golden run con- struction.

MC 5403

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