computable real function
A function is sequentially computable if, for every computable sequence of real numbers, the sequence is also computable.
A function is effectively uniformly continuous if there exists a recursive function such that, if
then
A real function is computable if it is both sequentially computable and effectively uniformly continuous.
It is not hard to generalize these definitions to functions of more than one variable or functions only defined on a subset of . The generalizations of the latter two definitions are so obvious that they need not be restated. A suitable generalization of the first definition is:
Let be a subset of . A function is sequentially computable if, for every -tuplet of computable sequences of real numbers such that
the sequence is also computable.
Title | computable real function |
---|---|
Canonical name | ComputableRealFunction |
Date of creation | 2013-03-22 14:39:23 |
Last modified on | 2013-03-22 14:39:23 |
Owner | rspuzio (6075) |
Last modified by | rspuzio (6075) |
Numerical id | 6 |
Author | rspuzio (6075) |
Entry type | Definition |
Classification | msc 03F60 |
Defines | sequentially computable |
Defines | effectively uniformly continuous |
Defines | effective uniform continuity |