An Elementary Construction of Unsolvable Word Problems in Group Theory

Publisher Summary This chapter presents an elementary construction of unsolvable word problems in group theory and introduces a new approach to constructing finitely presented groups with unsolvable word problems. The argument has a concrete motivation that makes it easy to follow. The chapter also discusses arrow notation and presents a proof of the Novikov–Boone theorem that states that there exists a finitely presented group whose word problem is not recursively solvable.