**Programming language for Computable Functions** — The Programming language for Computable Functions, or PCF, is a typed functional language introduced by Gordon Plotkin in 1977. It is based on the Logic of Computable Functions (LCF) by Dana Scott. It can be considered as a simplified version of… … Wikipedia

**computable function** — computable functions … Philosophy dictionary

**Computable function** — Total recursive function redirects here. For other uses of the term recursive function , see Recursive function (disambiguation). Computable functions are the basic objects of study in computability theory. Computable functions are the formalized … Wikipedia

**Computable number** — In mathematics, particularly theoretical computer science and mathematical logic, the computable numbers, also known as the recursive numbers or the computable reals, are the real numbers that can be computed to within any desired precision by a… … Wikipedia

**Computable analysis** — In mathematics, computable analysis is the study of which parts of real analysis and functional analysis can be carried out in a computable manner. It is closely related to constructive analysis. Basic results The computable real numbers form a… … Wikipedia

**Computable real function** — In mathematical logic, specifically computability theory, 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… … Wikipedia

**ICES Intertemporal Computable Equilibrium System** — affects regional and world economies. The model has been developed at the Climate Change Modelling and Policy Research Programme of the Fondazione Eni Enrico Mattei – FEEM, a research institution in the field of sustainable development.… … Wikipedia

**List of mathematical functions** — In mathematics, several functions or groups of functions are important enough to deserve their own names. This is a listing of pointers to those articles which explain these functions in more detail. There is a large theory of special functions… … Wikipedia

**Recursion theory** — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… … Wikipedia

**Computability theory** — For the concept of computability, see Computability. Computability theory, also called recursion theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown … Wikipedia