|
This article is cited in 3 scientific papers (total in 3 papers)
Characterizations of ITBM-computability. II
P. Koepkea, A. S. Morozovb a Rheinische Friedrich-Wilhelms-Univ. Bonn, Bonn, GERMANY
b Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk
Abstract:
We consider different characterizations of computability by means of infinite time Blum–Shub–Smale machines (ITBM) via specific functions on sets and computable infinitary formulas.
Keywords:
computability by means of Blum–Shub–Smale machines, infinitary formulas.
Received: 05.06.2020 Revised: 31.05.2021
Citation:
P. Koepke, A. S. Morozov, “Characterizations of ITBM-computability. II”, Algebra Logika, 60:1 (2021), 39–56; Algebra and Logic, 60:1 (2021), 26–37
Linking options:
https://www.mathnet.ru/eng/al2648 https://www.mathnet.ru/eng/al/v60/i1/p39
|
Statistics & downloads: |
Abstract page: | 188 | Full-text PDF : | 35 | References: | 21 | First page: | 4 |
|