Skip to search formSkip to main contentSkip to account menu

Primitive recursive function

Known as: Primitive recursive, Primitive recursive functions, Primitive recursive fuctions 
In computability theory, primitive recursive functions are a class of functions that are defined using primitive recursion and composition as central… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
The black hole attack is one of the security attacks that occur in Mobile Ad-hoc Networks (MANETs). In the attack, a malicious… 
Highly Cited
2005
Highly Cited
2005
A new methodology is presented to retrieve slant-range velocity estimates of moving targets inducing Doppler-shifts beyond the… 
Highly Cited
2003
Highly Cited
2003
Monoalkyl- and dialkyl-imidazolium surfactants were used to prepare organ- ically modified montmorillonites with markedly… 
2003
2003
Abstract For α less than ε0 let Nα be the number of occurrences of ω in the Cantor normal form of α. Further let ∣n∣ denote the… 
Highly Cited
2002
1997
1997
A real is called recursively enumerable if it can be approximated by an increasing, recursive sequence of rationals. The halting… 
1996
1996
Abstract Inspired by Pohlers' proof-theoretic analysis of KPω we give a straightforward non-metamathematical proof of the (well… 
1995
1995
This paper presents an approach to the problem of introducing non-primitive recursive function definitions in higher order logic…