Timeline for Is there a Turing degree which is a strong minimal cover and does not have itself a strong minimal cover?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 8, 2014 at 22:07 | comment | added | Archimondain | Thanks for the answer and for the link and references. I did not see the question asked in the litterature, I guess it's because it's too soon (in term of the knowledges we have so far on the subject) to be asked. Then there is the question of existence of strong minimal cover for countably many degrees (I think it should be called strong minimal upper bound then), but that is another problem... | |
| Jan 8, 2014 at 21:53 | vote | accept | Archimondain | ||
| Jan 8, 2014 at 15:57 | comment | added | Bjørn Kjos-Hanssen | For a graphical view of how these classes of Turing degrees fit together one can consult the Computability Menagerie (math.wisc.edu/~jmiller/menagerie.html) | |
| Jan 8, 2014 at 13:48 | history | answered | Bjørn Kjos-Hanssen | CC BY-SA 3.0 |