Some Non‐Recursive Classes of Thue Systems With Solvable Word Problem

This publication has 11 references indexed in Scilit:

• The solvability of the word problem for certain semigroups
  Proceedings of the American Mathematical Society, 1970
• The Solvability of the Word Problem for Certain Semigroups
  Proceedings of the American Mathematical Society, 1970
• A simple solution of the uniform halting problem
  The Journal of Symbolic Logic, 1970
• Word Problems and Recursively Enumerable Degrees of Unsolvability. A Sequel on Finitely Presented Groups
  Annals of Mathematics, 1966
• The undecidability of the Turing machine immortality problem
  The Journal of Symbolic Logic, 1966
• Computability of Recursive Functions
  Journal of the ACM, 1963
• Computable Algebra, General Theory and Theory of Computable Fields
  Transactions of the American Mathematical Society, 1960
• Computing degrees of unsolvability
  Mathematische Annalen, 1959
• Recursive Unsolvability of Group Theoretic Problems
  Annals of Mathematics, 1958
• Recursive Unsolvability of a problem of Thue
  The Journal of Symbolic Logic, 1947