Timeline for Self-similarity in the theory of computability
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 20, 2018 at 17:07 | vote | accept | Alexey Milovanov | ||
| Jun 25, 2014 at 5:48 | comment | added | Bjørn Kjos-Hanssen | Ishmukhametov showed any c.e. traceable set has a strong minimal cover. I think the proof uses a kind of forcing that gives degrees that contain bi-immune sets. So there should at least be a continuum of such $A$'s. | |
| Jun 25, 2014 at 5:24 | comment | added | Bjørn Kjos-Hanssen | I learned from Sasha Shen that perhaps the question really is whether given any $A$ there is $B\ge_T A$ such that any computably selected subsequence of $B$ or $\overline B$ computes $A$. | |
| Feb 7, 2014 at 18:31 | history | edited | Bjørn Kjos-Hanssen | CC BY-SA 3.0 |
added 75 characters in body
|
| Feb 7, 2014 at 18:23 | history | undeleted | Bjørn Kjos-Hanssen | ||
| Feb 7, 2014 at 18:23 | history | edited | Bjørn Kjos-Hanssen | CC BY-SA 3.0 |
added 125 characters in body
|
| Feb 7, 2014 at 18:21 | history | deleted | Bjørn Kjos-Hanssen | via Vote | |
| Feb 7, 2014 at 18:17 | history | answered | Bjørn Kjos-Hanssen | CC BY-SA 3.0 |