go-v.orgcodex
Menu
Page tools

codex · Philosophy

Computable real function

In mathematical logic, specifically computability theory, a function f:ℝ→ℝ is sequentially computable if, for every computable sequence {xi}i=1∞ of real numbers, the sequence {f(xi)}i=1∞ is also computable. A function f:ℝ→ℝ is effectively uniformly continuous if there exists a primitive recursive function d:ℕ→ℕ such that, if |x−y|<1/d(n), then |f(x)−f(y)|<1/n. A real function is thus computable if it is both sequentially computable and effectively uniformly continuous. These definitions can be generalized to functions of several variables as follows: let D be a subset of ℝn.

A function f:D→ℝ is sequentially computable if, for every n-tuple ({xi1}i=1∞,…,{xin}i=1∞) of computable sequences of real numbers such that

(xi1,…xin)∈D for all i, the sequence {f(xi)}i=1∞ is also computable.

Wikipedia contributors, "Computable real function", Wikipedia, revision 1372299371, retrieved 20 November 2026, source, CC BY-SA 4.0.

More Philosophy · Search the codex