Computability Learning SeminarExport this event to calendar

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

Jonathan Stephenson, Department of Pure Mathematics, University of Waterloo

“The Decanter Method (continued)”

Last week we introduced the decanter method, which we used to show that there is no wtt-complete K-trivial.

This week, we will strengthen the result by showing that a K-trivial cannot be Turing complete. We will see more clearly where the decanter method gets its name: our strategy will involve us assigning measure to a sequence of ”decanters” which may be ”poured” into each other. To complete the metaphor, we will see that occasionally we may suffer a ”spillage” and permanently lose some of our finite quantity of measure.

MC 5403

S M T W T F S
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
  1. 2021 (97)
    1. October (10)
    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)