Timeline for Are there recursive sets $X$ with Property A that contain infinitely many incompressible strings?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 6, 2017 at 2:39 | comment | added | Timothy Chow | I would venture to guess that the question "should" have specified lim rather than liminf, though of course only Andrew S. can say for sure. | |
| Jan 5, 2017 at 21:58 | comment | added | Laurent Bienvenu | ha indeed I read limit! So ok, as Joel says, if you only require liminf =0, the answer is obviously yes by putting in your set all strings of length N for all N in a sparse set of integers. With lim = 0 the answer is no as per my explanation. | |
| Jan 5, 2017 at 19:59 | comment | added | Joel David Hamkins | He only has liminf, not lim, and so unless I am mistaken, your remarks about "almost all" and "tends to" seem inaccurate. | |
| Jan 5, 2017 at 19:48 | history | answered | Laurent Bienvenu | CC BY-SA 3.0 |