Abstract: We examine nonstandard Heyting arithmetic extended with a feasibility predicate. Feasibility is defined as a downward closed property containing all numerals and closed under applications ...

recursive functions, ilan primitive, primitive, Reversible computing, Recursive permutations, idiotic turing maur pinocchio, maur, idiotic turing swine rovers turing, rovers ...

ABSTRACT: We prove that non-recursive base conversion can always be implemented by using a deterministic Markov process. Our paper discusses the pros and cons of recursive and non-recursive methods, ...

ABSTRACT: We prove that non-recursive base conversion can always be implemented by using a deterministic Markov process. Our paper discusses the pros and cons of recursive and non-recursive methods, ...

An influential line of thought claims that natural language and arithmetic processing require recursion, a putative hallmark of human cognitive processing (Chomsky, 2010; Fitch et al., 2005; Hauser et ...

Ask the publishers to restore access to 500,000+ books. A line drawing of the Internet Archive headquarters building façade. An illustration of a heart shape "Donate to the archive" An illustration of ...

In this paper we bound character sums of the shape ∑ n≤N χ 1 f n χ 2 f n+l , ; where χ1 and χ2 are non-principal multiplicative characters modulo a prime p, f(x) is a real-valued, twice-differentiable ...

Add a description, image, and links to the primitive-recursive-functions topic page so that developers can more easily learn about it.

The function is a block of code defined with a name. We use functions whenever we need to perform the same task multiple times without writing the same code again. It can take arguments and returns ...