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 | |
|---|---|---|---|---|---|
| Feb 18, 2011 at 2:00 | comment | added | Joseph O'Rourke | See also my note of June 3rd on this same problem. It deserves double mention! | |
| Jul 2, 2010 at 9:55 | comment | added | Swapnil Bhatia | Nice. I like the 1-PFA problem for the same reason. | |
| Jul 2, 2010 at 2:36 | history | answered | Timothy Chow | CC BY-SA 2.5 |