Word problems and recursively enumerable degrees at unsolvability. A first paper on Thue systems
From MaRDI portal
Publication:2531869
DOI10.2307/1970478zbMath0173.01204OpenAlexW2331518422MaRDI QIDQ2531869
Publication date: 1966
Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1970478
Related Items (16)
The post correspondence problem ⋮ The equivalence of some general combinatorial decision problems ⋮ The computability, definability, and proof theory of Artinian rings ⋮ Unnamed Item ⋮ Unsolvable algorithmic problems for semigroups, groups and rings ⋮ The many-one equivalence of some general combinatorial decision problems ⋮ Decision problems for cellular automata and their semigroups ⋮ Word problems and ceers ⋮ Degrees of unsolvability associated with Markov algorithms ⋮ An algebraic characterization of groups with soluble word problem ⋮ Combinatorial systems defined over one- and two-letter alphabets ⋮ Gruppen mit vorgeschriebenem Wortproblem ⋮ Recursively enumerable degress and the conjugacy problem ⋮ On recognising Hopf groups ⋮ On the complexity of reduction algorithms in Novikov-Boone constructions ⋮ Degrees of unsolvability of the conjugacy problem for finitely-presented groups
This page was built for publication: Word problems and recursively enumerable degrees at unsolvability. A first paper on Thue systems
