Timeline for Decision problems and group representations
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 21, 2011 at 12:16 | vote | accept | ADL | ||
| Sep 20, 2011 at 18:50 | comment | added | Benjamin Steinberg | The strange thing about Turing machines is you can assume they know any finite amount information which is independent of the input even if we ourselves don't know this information. This is why the word problem doesn't depend on the choice of finite generating set. I may not know how to write the generators from one set as a word in the generators in the other set, but since there are only finitely many generators, there is a Turing machine that does. Knowing this fixed finite information it can algorithmically rewrite any input word in the other generating set and use its word problem TM. | |
| Sep 20, 2011 at 8:59 | vote | accept | ADL | ||
| Sep 20, 2011 at 8:59 | |||||
| Sep 20, 2011 at 8:59 | comment | added | ADL | Ah, okay, thanks for clearing up my misconceptions! | |
| Sep 20, 2011 at 1:27 | history | edited | Benjamin Steinberg | CC BY-SA 3.0 |
Clarify
|
| Sep 20, 2011 at 0:56 | history | answered | Benjamin Steinberg | CC BY-SA 3.0 |