|
|
|
|
Список литературы
|
|
| |
| 1. |
И.В. Ашаев, В.Я.Беляев, А.Г. Мясников, “Подходы к теории обобщенной вычислимости”, Алгебра и логика, 32:4 (1993), 349–386    |
| 2. |
А.Н. Рыбалов, “Сложность вычислений в алгебраических системах”, Сибирский математический журнал, 45:6 (2004), 1365–1377 |
| 3. |
L. Blum, M. Shub, S. Smale, “On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines”, Bull. Amer. Math. Soc., 21 (1989), 1–46   |
| 4. |
T. Baker, J. Gill, R. Solovay, “Relativizations of the P=?NP question”, SIAM Journal on Computing, 4 (1975), 431–442 |
| 5. |
F. Cucker, M. Matamala, “On digital nondeterminism”, Math. Syst. Theory, 29 (1996), 635–647 |
| 6. |
T. Emerson, “Relativization of the P=?NP question over the reals (and other ordered rings)”, Theoretical Computer Science, 133 (1994), 15–22 |
| 7. |
A. Hemmerling, “Computability and complexity over structures”, Math. Logic Quarterly, 44:1 (1998), 1–44 |
