We consider generalized register machines over ordered rings with an auxiliary binary
operation. In particular, we consider the ring of integers, its infinite Cartesian power, and …

We prove that P≠ DNP over rings of matrices with real elements in a restricted Blum–Shub–
Smale computational model. The restriction is that machines can use only two constants …

В работе [1] впервые были рассмотрены вычислимость и сложность вычислений над
полями вещественных и комплексных чисел. Этот подход был обобщен для …

Relativized complexity classes are actively studied in the computation complexity theory
since 1975. Classical result of Baker, Gill and Solovay states that there exist two oracles A …

In this party, we want to discuss some of the points when two computational theoretic
framework models working on the set of real numbers are the Blum–Shub–Smale machine …

Рассматирвается теория сложности вычислений над произвольными алгебраическими
системами, развитая Рыбаловым на основе подхода к обобщенной вычислимости …

The paper presents two situations where unit-cost complexity results are closely related with
results from the classical computability.* In Section 2 we study an important theorem by …

254 Conferences committee, assisted by a number of external reviewers, has led to the
acceptance of 23 papers for presentation at the meeting and inclusion in the Proceedings …

A problem naturally arizing in the unit-cost complexity class NP over the field а of complex
numbers consists in deciding if an input of length 2n belongs to a special absolutely …