Skip to search formSkip to main contentSkip to account menu

Μ-recursive function

Known as: Partial recursive function, Recursive function, M-recursive function 
In mathematical logic and computer science, the μ-recursive functions are a class of partial functions from natural numbers to natural numbers that… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
In this paper, a three-layer framework is proposed for mobile data collection in wireless sensor networks, which includes the… 
2007
2007
Two central concerns in the sustainability debate are the weight given to the needs of future generations and the application of… 
2007
2007
Reduced failure rates required by the industry lead to increased costs and time loss for the chip manufacturer since the efforts… 
2001
2001
General recursive algorithms are such that the recursive calls are performed on arguments satisfying no condition that guarantees… 
1996
1996
One of the most important and challenging areas of research in evolutionary algorithms is the investigation of ways to… 
1991
1991
The authors present an alternative derivation of the general recursive least squares (RLS) algorithm using homotopy approaches… 
1990
1990
A model for automated manufacturing suited for achieving fault-tolerant production is presented. It is shown that the configuring… 
1983
1983
This paper is concerned with the construction of de Bruijn sequences of span n --binary sequences of period 2^{n} in which every… 
1981
1981
It has long been known that deterministic 1-way counter machines recognize exactly all r.e. sets. Here we investigate counter…