An analysis of Turing's The word problem in semi-groups with cancellation
From MaRDI portal
Publication:770290
Cited in
(6)- The developments of the concept of machine computability from 1936 to the 1960s
- Conceptual Confluence in 1936: Post and Turing
- The word problem for cancellation semigroups with zero
- On one-relator groups and units of special one-relation inverse monoids
- Unsolvable algorithmic problems for semigroups, groups and rings
- The word problem for one-relation monoids: a survey
This page was built for publication: An analysis of Turing's The word problem in semi-groups with cancellation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q770290)