Timeline for Are there recursive sets $X$ with Property A that contain infinitely many incompressible strings?
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 8, 2017 at 17:56 | vote | accept | Andrew S. | ||
| Jan 5, 2017 at 19:48 | answer | added | Laurent Bienvenu | timeline score: 3 | |
| Jan 5, 2017 at 17:38 | comment | added | Joel David Hamkins | You are right, and that prevents limit=0, but the idea still works for liminf by adding all strings of length n for a sufficiently sparse set of n. | |
| Jan 5, 2017 at 17:22 | answer | added | Payam Seraji | timeline score: 5 | |
| Jan 5, 2017 at 17:09 | comment | added | Andreas Blass | @JoelDavidHamkins Your suggestion seems to require being able to tell when a string is incompressible, but as far as I know, incompressibility is only co-r.e. | |
| Jan 5, 2017 at 16:31 | review | Close votes | |||
| Jan 5, 2017 at 21:50 | |||||
| Jan 5, 2017 at 16:26 | comment | added | Joel David Hamkins | In fact, that idea will make $X$ have density zero, with lim=0 instead of merely liminf. | |
| Jan 5, 2017 at 16:09 | comment | added | Joel David Hamkins | Can't you just add another such string, and then wait a long time, adding nothing, so that the density comes down very low, before adding the next one, of correspondingly long length? (And could you clarify whether you intend that $X$ is a set of strings, or a set of numbers from which strings are drawn? And does $X^{\leq n}$ means the subset of $X$ of strings of length at most $n$?) | |
| Jan 5, 2017 at 16:05 | history | edited | Asaf Karagila♦ |
edited tags
|
|
| Jan 5, 2017 at 16:01 | review | First posts | |||
| Jan 5, 2017 at 16:11 | |||||
| Jan 5, 2017 at 15:58 | history | asked | Andrew S. | CC BY-SA 3.0 |