Timeline for What are the most attractive Turing undecidable problems in mathematics?
Current License: CC BY-SA 2.5
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:32 | history | edited | CommunityBot |
replaced http://cstheory.stackexchange.com/ with https://cstheory.stackexchange.com/
|
|
| Feb 26, 2011 at 18:10 | history | edited | John Sidles | CC BY-SA 2.5 |
The undecidability assertion now is called "Viola's theorem"
|
| Feb 19, 2011 at 0:50 | history | answered | John Sidles | CC BY-SA 2.5 |