This paper introduces Farey Recursive Functions and investigates their basic properties. are a special type of recursive function from the rationals to commutative ring. The recursion these functions is organized by graph. They arise naturally in study 2-bridge knots links.

We present a novel approach to synthesizing recursive functional programs from input-output examples. Synthesizing function is challenging because subexpressions should be constructed while the target has not been fully defined yet. address this challenge by using new technique we call block-based pruning. A block refers recursion- and conditional-free expression (i.e., straight-line code) that...

In this paper it has been attempted to investigate the capability of the consumption-based capital asset pricing model (CCAPM), using the general method of moment (GMM), with regard to the Epstien-zin recursive preferences model for Iran's capital market. Generally speaking, recursive utility permits disentangling of the two psychologically separate concepts of risk aversion and elasticity of i...

Mathematicians, like so many other intellectuals, made a great effort to find a secure foundation for their subject in the latter part of the nineteenth century and this continued into the early twentieth century. For logicians this endeavour culminated in Hilbert's programme. As we all know, this programme suffered a mortal blow from G6del's incompleteness, or better incompletability, theorem;...

The integer word-length optimization known as range analysis (RA) of the fixed-point designs is a challenging problem in high level synthesis and optimization of linear-time-invariant (LTI) systems. The analysis has significant effects on the resource usage, accuracy and efficiency of the final implementation, as well as the optimization time. Conventional methods in recursive LTI systems suffe...