2-knot
Unsolvability of word problem for 2-knot complements โ โ โ
Author(s): Gordon
Problem Does there exist a smooth/PL embedding of in such that the fundamental group of the complement has an unsolvable word problem?
Keywords: 2-knot; Computational Complexity; knot theory