ITBM-Constructive Completions of Algebras
-
Published:2024-05
Issue:3
Volume:65
Page:589-598
-
ISSN:0037-4466
-
Container-title:Siberian Mathematical Journal
-
language:en
-
Short-container-title:Sib Math J
Publisher
Pleiades Publishing Ltd
Reference8 articles.
1. Koepke P. and Seyfferth B., “Towards a theory of infinite time Blum–Shub–Smale machines,” in: How the World Computes. Turing Centenary Conference and
8th Conference on Computability in Europe, CiE 2012
Cambridge, UK, June 18–23, 2012 Proceedings, Springer, Heidelberg (2012), 405–415 (Lecture Notes in Comput. Sci.; vol. 7318).
2. Koepke P. and Morozov A.S., “The computational power of infinite time Blum–Shub–Smale machines,” Algebra Logic, vol. 56, no. 1, 37–62 (2017).
3. Koepke P. and Morozov A.S., “Characterizations of ITBM-computability. I,” Algebra Logic, vol. 59, no. 6, 423–436 (2020).
4. Koepke P. and Morozov A.S., “Characterizations of ITBM-computability. II,” Algebra Logic, vol. 60, no. 1, 26–37 (2021).
5. Bourbaki N., Theory of Sets, Springer, Berlin and Heidelberg (2004).