A RESIDUALLY FINITE ASSOCIATIVE ALGEBRA WITH AN UNDECIDABLE WORD PROBLEM

For any constructive commutative ring k with unity, we furnish an example of a residually finite, finitely generated, recursively defined (associative k-algebra with unity whose word problem is undecidable. This answers a question of Bokutʹ in [3].