Timeline for What are the most attractive Turing undecidable problems in mathematics?
Current License: CC BY-SA 2.5
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 24, 2010 at 19:08 | comment | added | Swapnil Bhatia | Yes, this is Rice's theorem. I am stating it for completeness of the list: I don't see it listed. | |
| Jun 24, 2010 at 18:35 | comment | added | Joel David Hamkins | Yes, they are undecidable from the programs that decide them. See Rice's Theorem: en.wikipedia.org/wiki/Rice's_theorem | |
| Jun 24, 2010 at 18:24 | history | edited | Swapnil Bhatia | CC BY-SA 2.5 |
added 1 characters in body
|
| Jun 24, 2010 at 9:54 | history | answered | Swapnil Bhatia | CC BY-SA 2.5 |