Timeline for Verify that a group is hyperbolic via computer algebra
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 13, 2016 at 12:18 | vote | accept | Timm von Puttkamer | ||
| May 13, 2016 at 10:03 | comment | added | Derek Holt | There is a GAP forum mailing list that you use to ask if anyone has written any small cancellation software. It seems quite likely that somebody might have done! | |
| May 13, 2016 at 9:15 | answer | added | Derek Holt | timeline score: 13 | |
| May 13, 2016 at 9:03 | comment | added | Timm von Puttkamer | @RyanBudney: Yes, a pseudo-algorithm is fine. | |
| May 13, 2016 at 8:56 | comment | added | HJRW | @RyanBudney, the OP seems to be aware of this, since they stipulate that the algorithm might not terminate. | |
| May 13, 2016 at 8:38 | comment | added | Ryan Budney | No. No such algorithm exists. Do you want a pseudo-algorithm? i.e. one that might not always terminate in a known amount of time? If so there are such. But genuine algorithms, no. If one existed you could use it to solve the "groups is trivial" problem. It's known this is not an algorithmically-solvable problem. | |
| May 13, 2016 at 8:28 | history | asked | Timm von Puttkamer | CC BY-SA 3.0 |