Timeline for Decision Problem for finitely generated subgroups
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Sep 24, 2012 at 23:53 | vote | accept | i. m. soloveichik | ||
| Sep 14, 2012 at 2:05 | comment | added | Benjamin Steinberg | @Misha, this is a nice answer. There is a very slight misstatement. There is no such thing as a single finite presentation for which it is undecidable whether the group is finite or not. Either the Turing machine that says yes or the one which says no is correct. What is undecidable is the uniform problem. Similarly finite presentability is undecidable as a uniform problem, not for a fixed subgroup. On the other hand the generalized word problem is unsolvable for a fixed subgroup. | |
| Sep 13, 2012 at 21:47 | vote | accept | i. m. soloveichik | ||
| Sep 16, 2012 at 2:11 | |||||
| Sep 13, 2012 at 20:48 | history | answered | Misha | CC BY-SA 3.0 |