Timeline for Finitely presented algebra
Current License: CC BY-SA 4.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 9, 2021 at 18:05 | comment | added | Benjamin Steinberg | The word problem for semigroups was shown to be undecidable much earlier around 1947 independently by Markov and Post. This proof is much easier and can be understood as soon as you know the definition of a Turing machine. | |
| Apr 9, 2021 at 15:14 | history | answered | Ben McKay | CC BY-SA 4.0 |