Generically Computable abelian groups

DOI10.1007/978-3-031-34034-5_3OpenAlexW4378879222MaRDI QIDQ6149112

Valentina S. Harizanov, Douglas Cenzer, Wesley Calvert

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

computabilityabelian \(p\)-groupgenerically computable\( \varSigma_n\) elementary substructure

Mathematics Subject Classification ID

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

Cites Work

• Effective categoricity of abelian \(p\)-groups
• Generic-case complexity, decision problems in group theory, and random walks.
• Generic computability, Turing degrees, and asymptotic density
• Asymptotic Density and the Theory of Computability: A Partial Survey
• A robuster Scott rank
• Generically and coarsely computable isomorphisms
• Densely computable structures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item