Timeline for What are the most attractive Turing undecidable problems in mathematics?
Current License: CC BY-SA 2.5
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 17, 2010 at 18:08 | history | edited | Hans-Peter Stricker | CC BY-SA 2.5 |
corrected the link
|
| Jan 12, 2010 at 20:57 | comment | added | Ryan Budney | It's still undecidable up to an ambient homeomorphism. And the undecidablility is again a fundamental group issue -- there's a certain type of group presentation called a Wirthinger presentation. Given any such presentation there's an algorithm to construct a knot ($n>2$) such that $\pi_1$ of the complement has that Wirthinger presentation. | |
| Jan 12, 2010 at 20:37 | comment | added | user1073 | An ambient isotopy | |
| Jan 12, 2010 at 20:31 | comment | added | Joey Hirsh | What kind of deformation of $\mathbb{R}^{n+2}$? | |
| Jan 12, 2010 at 19:24 | history | answered | user1073 | CC BY-SA 2.5 |