computable function


Also found in: Wikipedia.

computable function

[kəm¦pyüd·ə·bəl ′fəŋk·shən]
(mathematics)
A function whose value can be calculated by some Turing machine in a finite number of steps. Also known as effectively computable function.
References in periodicals archive ?
Notably, each computable function can be expressed by a finitely ground program; membership in this class is not decidable, but it has been proven to be semidecidable (Calimeri et al.
From the computable function Succ, we can define and calculate a function [Succ.
An indexing is admissible if there exists a computable function m : N x N [right arrow] N such that [g.
Based on the logic of what was in the machine, Turing showed that any computable function could be calculated," Kahn said.
Recall that a computable function must be specifiable by a finite number of bits.
This is the well known principle that for any computable function, there exist distinct multiple programs that will compute it.
The function describing this quantity can be a simple algebraic expression, any computable function of a group of parameters, or an FEA model of physical phenomena.
The function F is a computable function that is continuous in its (d + 2) arguments however it is also analytic in the variable [theta].
2] is computable function, defined for all x [member of] [[SIGMA].
Some, and probably all, uncomputable functions have a corresponding computable function that gets the same result 99.
if there is a total computable function h : [summation over (term)] * [right arrow] [?
Lambda calculus is a theory of computable functions that focuses on evaluation of expressions resulted from applying functions to other expressions.