Will Dison
YOU?
Author Swipe
View article: Ackermannian Integer Compression and the Word Problem for Hydra Groups
Ackermannian Integer Compression and the Word Problem for Hydra Groups Open
For a finitely presented group, the word problem asks for an algorithm which declares whether or not words on the generators represent the identity. The Dehn function is a complexity measure of a direct attack on the word problem by applyi…
View article: Ackermannian Integer Compression and the Word Problem for Hydra Groups.
Ackermannian Integer Compression and the Word Problem for Hydra Groups. Open
For a finitely presented group, the word problem asks for an algorithm which declares whether or not words on the generators represent the identity. The Dehn function is a complexity measure of a direct attack on the word problem by applyi…