|
This article is cited in 25 scientific papers (total in 25 papers)
Conditional terms and their applications in algebra and computation theory
A. G. Pinus Novosibirsk State Technical University
Abstract:
The notion of program-computable function on a universal
algebra is formalized through the notion of conditional term.
This leads to a somewhat new approach to the study of traditional
algebraic problems related to both universal classes and specific
finite algebras, and also enables one to pose and investigate the
problem of the computation resources of universal
algebras.
Received: 30.10.2000
Citation:
A. G. Pinus, “Conditional terms and their applications in algebra and computation theory”, Uspekhi Mat. Nauk, 56:4(340) (2001), 35–72; Russian Math. Surveys, 56:4 (2001), 649–686
Linking options:
https://www.mathnet.ru/eng/rm415https://doi.org/10.1070/RM2001v056n04ABEH000415 https://www.mathnet.ru/eng/rm/v56/i4/p35
|
Statistics & downloads: |
Abstract page: | 527 | Russian version PDF: | 235 | English version PDF: | 19 | References: | 42 | First page: | 1 |
|