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)

Related topics

Related topics

49 relations
Ackermann functionAlgorithm characterizationsArithmetical hierarchyBIT predicate

Broader (1)

Recursion

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
Black hole attack prevention based on authentication mechanism
The black hole attack is one of the security attacks that occur in Mobile Ad-hoc Networks (MANETs). In the attack, a malicious… 
2006
2006
Degradation and Recovery of the Emission From a Graphite Cathode in Relation to the Repetition Frequency of Nanosecond Accelerating Pulses
A study has been performed on the emissive characteristics of a cold graphite cathode in a magnetically insulated coaxial diode… 
2006
2006
Electronic beam-steering design for UWB phased array
A novel electronic beam-steering subsystem providing true time-delay technique has been developed for an ultra-wideband (UWB… 
Highly Cited
2003
Highly Cited
2003
Melt-Processable Syndiotactic Polystyrene/Montmorillonite Nanocomposites
Monoalkyl- and dialkyl-imidazolium surfactants were used to prepare organ- ically modified montmorillonites with markedly… 
2003
2003
An application of graphical enumeration to PA*
Abstract For α less than ε0 let Nα be the number of occurrences of ω in the Cantor normal form of α. Further let ∣n∣ denote the… 
2002
2002
A fast algorithm for determining the minimal polynomial where of a sequence with period 2pn over GF(q)
A fast algorithm is presented for determining the linear complexity and the minimal polynomial of a sequence with period 2p/sup n… 
1998
1998
Geo/G/1 discrete time retrial queue with Bernoulli schedule
1996
1996
How to characterize provably total functions by local predicativity
Abstract Inspired by Pohlers' proof-theoretic analysis of KPω we give a straightforward non-metamathematical proof of the (well… 
1995
1995
Non-primitive Recursive Function Definitions
This paper presents an approach to the problem of introducing non-primitive recursive function definitions in higher order logic… 
1969
1969
Uniformly reflexive structures: On the nature of gödelizations and relative computability
In this paper we present an axiomatic theory within which much of the theory of computability can be developed in an abstract… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)