Generically Computable abelian groups

DOI10.1007/978-3-031-34034-5_3MaRDI QIDQ6149112zbMATH OpenOpenAlexFDO

Authors Wesley Calvert, Douglas Cenzer, Valentina Harizanov

Publication date 12 January 2024

Published in Unconventional Computation and Natural Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-34034-5_3

zbMATH Keywords

\( \varSigma_n\) elementary substructureabelian \(p\)-groupcomputabilitygenerically computable

Mathematics Subject Classification ID

Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07) Other nonclassical models of computation (68Q09) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum algorithms and complexity in the theory of computing (68Q12)

Cites work

• A robuster Scott rank
• Asymptotic density and the theory of computability: a partial survey
• 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
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 1303204 (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?)

Cited in

(1)

• Generically computable abelian groups and isomorphisms

This page was built for publication: Generically Computable abelian groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6149112)