On the Algorithmic Unsolvability of the Word Problem in Group Theory

Novikov, P. S. (1955). On the Algorithmic Unsolvability of the Word Problem in Group Theory.

Type

Unclassified

Intellectual base

Unclassified

Year

1955

Link

no authoritative link yet

Cited by

1 citation across 1 artifact.

Domain-specific

• Word problem for groups
  • The word problem asks for an algorithm that determines, for every pair of generator words, whether they denote the same group element.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:640b6d9949b1 · see in the full table