The word problem on finitely presented groups is unsolvable.
Intuition: We show that group
presentations are enough to create a Turing machine.
States:
Alphabet:
Transition function:
There are finitely presented solvable groups of derived length 3 with an unsolvable word problem
It's unknown whether this can be reduced to derive[2026-06-06 Sat] At the hotel, briefly met
d length 2 (metabelian groups).
The smallest presentations so far for undecidability have been