Abstract :
We construct a two-generated group with the co-recursively enumerable word problem that has no presentation by recursive permutations. This answers Higmanʹs question and exemplifies a group with the minimal possible number of generators. The previous article [1], in which that question was claimed settled; contains an incorrigible error.
Keywords :
Polymer latex , drying , surfactants , Plasticisers , Pigment volume fraction , Film formation , morphology
