Timeline for Does it make sense to talk about the complexity of non-computable functions (such as the Halting problem)?
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 10, 2018 at 13:50 | review | Suggested edits | |||
| Mar 10, 2018 at 16:45 | |||||
| Mar 9, 2018 at 22:01 | vote | accept | M Smith | ||
| Mar 9, 2018 at 17:08 | history | answered | David Richerby | CC BY-SA 3.0 |