Timeline for A non-mechanical way to get an infinite decidable subset of a Turing-recognizable language?
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 28, 2015 at 16:53 | vote | accept | templatetypedef | ||
| Dec 27, 2015 at 11:28 | history | answered | Andrej Bauer | CC BY-SA 3.0 |