Computable real function

In mathematical logic, specifically computability theory, a function f : R → R is sequentially computable if, for every computable sequence { x i } i = 1 ∞ of real numbers, the sequence { f ( x i ) } i = 1 ∞ is also computable.

A function f : R → R is effectively uniformly continuous if there exists a recursive function d : N → N such that, if

| x − y | < 1 d ( n )

then

| f ( x ) − f ( y ) | < 1 n

A real function is computable if it is both sequentially computable and effectively uniformly continuous,

These definitions can be generalized to functions of more than one variable or functions only defined on a subset of R n . The generalizations of the latter two need not be restated. A suitable generalization of the first definition is:

Let D be a subset of R n . A function f : D → R is sequentially computable if, for every n -tuplet ( { x i 1 } i = 1 ∞ , … { x i n } i = 1 ∞ ) of computable sequences of real numbers such that

( ∀ i ) ( x i 1 , … x i n ) ∈ D ,

the sequence { f ( x i ) } i = 1 ∞ is also computable.

This article incorporates material from Computable real function on PlanetMath, which is licensed under the Creative Commons Attribution/Share-Alike License.