Заглавие | A SIMPLE CHARACTERIZATION OF THE COMPUTABILITY OF REAL FUNCTIONS |
Вид публикация | Journal Article |
Година на публикуване | 2013 |
Автори | Skordev D |
Списание | Annuaire de l’Université de Sofia “St. Kliment Ohridski”. Faculté de Mathématiques et Informatique |
Том | 101 |
ключови думи | Approximation, computable, continuous, Enumeration, enumeration operator, real function, real number, recursive operator, recursively enumerable set, TTE |
Резюме | The TTE-approach to computability of real functions uses infinitary names of the argument's and the function's values, computability being defined as the existence of some algorithmic procedure transforming the names of any argument's value into ones of the corresponding value of the function. Two ways to avoid using such names are considered in the present paper. At each of them, the corresponding characterization of computability of real functions is through the existence of an appropriate recursively enumerable set establishing some relation between rational approximations of the argument's value and rational approximations of the corresponding value of the function. |
2010 MSC | 03D78 |
Прикачен файл | Размер |
---|---|
101-115-122.pdf | 149.69 KB |