scientific article; zbMATH DE number 1534357

zbMath0956.20025MaRDI QIDQ4517144

Andrey S. Morozov

Publication date: 21 November 2000

Full work available at URL: https://eudml.org/doc/187922

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

two-generated groupsgroups of recursive permutationsgroups with co-recursively enumerable word problems

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) General theory for infinite permutation groups (20B07) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Recursive functions and relations, subrecursive hierarchies (03D20) Word problems, etc. in computability and recursion theory (03D40) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Infinite automorphism groups (20B27)

Related Items (3)

Sofic profiles of \(S(\omega)\) and computability ⋮ Uniform \(m\)-equivalencies and numberings of classical systems ⋮ Computable permutations and word problems

This page was built for publication: