Timeline for What are the most attractive Turing undecidable problems in mathematics?
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 18, 2020 at 14:10 | history | edited | Martin Sleziak | CC BY-SA 4.0 |
http -> https (the question has been bumped anyway)
|
| May 25, 2010 at 4:00 | comment | added | Victor Protsak | It's staggering to learn that 2 does not have an easy decision procedure! I suppose that it has to do with diophantine properties of complex PF numbers (algebraic numbers with at least one conjugate with the same absolute value and none with larger). | |
| Feb 15, 2010 at 2:55 | history | answered | Richard Stanley | CC BY-SA 2.5 |