PSEUDORECURSIVE VARIETIES OF SEMIGROUPS—I

DOI10.1142/S0218196796000271zbMath0856.03035OpenAlexW4238853478MaRDI QIDQ3837512

Benjamin B. jun. Wells

Publication date: 24 February 1997

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218196796000271

zbMATH Keywords

undecidabilitydecidabilityTuring machineequational theoryword problemspseudorecursive varieties\(n\)-variable partsbounded machine resources

Mathematics Subject Classification ID

Varieties and pseudovarieties of semigroups (20M07) Undecidability and degrees of sets of sentences (03D35) Decidability of theories and sets of sentences (03B25) Word problems, etc. in computability and recursion theory (03D40) Equational classes, universal algebra in model theory (03C05) Turing machines and related notions (03D10)

Related Items (7)

PSEUDORECURSIVE VARIETIES OF SEMIGROUPS — II ⋮ Applying, extending, and specializing pseudorecursiveness ⋮ A variety with locally solvable but globally unsolvable word problem ⋮ Hypercomputation by definition ⋮ The case for hypercomputation ⋮ A finitely axiomatizable undecidable equational theory with recursively solvable word problems ⋮ Small semigroup related structures with infinite properties

This page was built for publication: PSEUDORECURSIVE VARIETIES OF SEMIGROUPS—I