I was reading Rotman's "An Introduction to the theory of Groups" Chapter 12 "The Word Problem". I cannot understand the key concepts of Turing Machines and undecidibilty. I want to prove understand the proof "There exists a finitely presented group which has unsolvable word problem". Can anyone point out any beginner friendly reference to reading this theorem? And maybe chalk out a outline how this proof goes.
Thanks in advance