Abstract
Generically computable sets, as introduced by Jockusch and Schupp, have been of great interest in recent years. This idea of approximate computability was motivated by asymptotic density problems studied by Gromov in combinatorial group theory. More recently, we have defined notions of generically computable structures, and studied in particular equivalence structures and injection structures. A structure is said to be generically computable if there is a computable substructure defined on an asymptotically dense set, where the functions are computable and the relations are computably enumerable. It turned out that every equivalence structure has a generically computable copy, whereas there is a non-trivial characterization of the injection structures with generically computable copies.
In this paper, we return to group theory, as we explore the generic computablity of Abelian groups. We show that any Abelian p-group has a generically computable copy and that such a group has a \(\varSigma _2\)-generically computably enumerable copy if and only it has a computable copy. We also give a partial characterization of the \(\varSigma _1\)-generically computably enumerable Abelian p-groups. We also give a non-trivial characterization of the generically computable Abelian groups that are not p-groups.
This research was partially supported by the National Science Foundation SEALS grant DMS-1362273. The work was done partially while the latter two authors were visiting the Institute for Mathematical Sciences, National University of Singapore, in 2017. The visits were supported by the Institute. This material is partially based upon work supported by the National Science Foundation under grant DMS-1928930 while all three authors participated in a program hosted by the Mathematical Sciences Research Institute in Berkeley, California during the Fall 2020 semester. Harizanov was partially supported by the Simons Foundation grant 853762 and NSF grant DMS-2152095.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Calvert, W., Cenzer, D., Harizanov, V.: Densely computable structures. J. Logic Comput. 32, 581–607 (2022)
Calvert, W., Cenzer, D., Harizanov, V.: Generically and coarsely computable isomorphisms. Computability 11, 223–239 (2022). https://doi.org/10.3233/COM-210382
Calvert, W., Cenzer, D., Harizanov, V., Morozov, A.: Effective categoricity of Abelian p-groups. Ann. Pure Appl. Logic 159, 187–197 (2009)
Fuchs, L.: Infinite Abelian groups, volume I, Academic Press (1970)
Jockusch, C.G., Schupp, P.E.: Generic computability, Turing degrees, and asymptotic density. J. London Math. Soc. 85, 472–490 (2012)
Jockusch, C.G. Schupp, P.E.: Asymptotic density and the theory of computability: a partial survey. In: Computability and Complexity, Lecture Notes in Computer Science, vol. 10010, pp. 501–520 (2017)
Kaplansky, I.: Infinite Abelian groups, University of Michigan Press (1954)
Kapovich, I., Myasnikov, A., Schupp, P., Shpilrain, V.: Generic-case complexity, decision problems in group theory, and random walks. J. Algebra 264, 665–694 (2003)
Khisamiev, N.G.: Constructive Abelian groups, Handbook of Recursive Mathematics, Vol. 2, Stud. Logic Found. Math., vol. 139, Elsevier, pp. 1177–1231 (1998)
Montalbán, A.: A robuster Scott rank. Proc. Am. Math. Soc. 143, 5427–5436 (2015)
Rotman, J.J.: The theory of groups, Allyn and Bacon (1965)
Soare, R.I.: Recursively Enumerable Sets and Degrees. Springer-Verlag (1987)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Calvert, W., Cenzer, D., Harizanov, V. (2023). Generically Computable Abelian Groups. In: Genova, D., Kari, J. (eds) Unconventional Computation and Natural Computation. UCNC 2023. Lecture Notes in Computer Science, vol 14003. Springer, Cham. https://doi.org/10.1007/978-3-031-34034-5_3
Download citation
DOI: https://doi.org/10.1007/978-3-031-34034-5_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-34033-8
Online ISBN: 978-3-031-34034-5
eBook Packages: Computer ScienceComputer Science (R0)