RUS  ENG
Full version
JOURNALS // Algebra i logika // Archive

Algebra Logika, 2021 Volume 60, Number 1, Pages 39–56 (Mi al2648)

This article is cited 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.

UDC: 510.5

Received: 05.06.2020
Revised: 31.05.2021

DOI: 10.33048/alglog.2020.60.103


 English version:
Algebra and Logic, 2021, 60:1, 26–37

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025