Computability Learning SeminarExport this event to calendar

Wednesday, July 13, 2016 — 9:30 AM EDT

Michael Deveau, Department of Pure Mathematics, University of Waterloo

“The Golden Run Construction - Part 3”

After our short interlude into K-degrees, we return to the details of the golden run construc- tion. We will focus our attention on verifying that the procedures P and Q defined formally last time operate as they should and ultimately respect their garbage quotas. This will allow us to use the Recursion Theorem to find a set of procedures that contain a golden run, and ultimately show that A is low for K.

MC 5403

**Please Note Time**

S M T W T F S
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
  1. 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)
  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)