Timeline for Is there constructive proof of the fact that every recursive set $A \ne \varnothing$ is recursively enumerable in non-decreasing order?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 12, 2012 at 6:20 | vote | accept | John Rice | ||
| Jan 9, 2012 at 21:43 | vote | accept | John Rice | ||
| Jan 9, 2012 at 21:43 | |||||
| Jan 9, 2012 at 0:28 | comment | added | Goldstern | Indeed, a much nicer and better readable formulation than mine. | |
| Jan 9, 2012 at 0:18 | history | edited | Andrej Bauer | CC BY-SA 3.0 |
added 10 characters in body; edited body; deleted 10 characters in body
|
| Jan 9, 2012 at 0:01 | history | edited | Andrej Bauer | CC BY-SA 3.0 |
added 106 characters in body
|
| Jan 8, 2012 at 23:55 | history | edited | Andrej Bauer | CC BY-SA 3.0 |
Answered what was actually asked.; added 383 characters in body
|
| Jan 8, 2012 at 23:35 | history | answered | Andrej Bauer | CC BY-SA 3.0 |