Generically computable abelian groups and isomorphisms
From MaRDI portal
Cites work
- A robuster Scott rank
- Asymptotic density and the theory of computability: a partial survey
- Autostability of models and Abelian groups
- Computable Algebra, General Theory and Theory of Computable Fields
- Densely computable structures
- Effective categoricity of abelian p-groups
- Generic computability, Turing degrees, and asymptotic density
- Generic-case complexity, decision problems in group theory, and random walks.
- Generically and coarsely computable isomorphisms
- Generically Computable abelian groups
- scientific article; zbMATH DE number 3767640 (Why is no real title available?)
- scientific article; zbMATH DE number 1303204 (Why is no real title available?)
- scientific article; zbMATH DE number 479558 (Why is no real title available?)
- scientific article; zbMATH DE number 3332554 (Why is no real title available?)
- scientific article; zbMATH DE number 3198885 (Why is no real title available?)
- scientific article; zbMATH DE number 3090999 (Why is no real title available?)
- On the algorithmic insolvability of the word problem in group theory
- THE WORD PROBLEM
This page was built for publication: Generically computable abelian groups and isomorphisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6923513)