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)

Related topics

Related topics

27 relations
Ackermann functionChurch–Turing thesisComputabilityComputable function

Broader (1)

Computability theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Separation Logic with Monadic Inductive Definitions and Implicit Existentials
This paper proves the decidability of entailments in separation logic with monadic inductive definitions and implicit… 
Highly Cited
2014
Highly Cited
2014
Exponential Decay of Reconstruction Error From Binary Measurements of Sparse Signals
Binary measurements arise naturally in a variety of statistics and engineering applications. They may be inherent to the problem… 
2008
2008
A Most General Edge Elimination Polynomial
We look for graph polynomials which satisfy recurrence relations on three kinds of edge elimination: edge deletion, edge… 
Highly Cited
2004
Highly Cited
2004
A general framework for unsupervised processing of structured data
1991
1991
Quality control for differential kinematic GPS positioning
  • G. Lu
  • 1991
  • Corpus ID: 115435994
Highly Cited
1989
Highly Cited
1989
Program Derivation by Fixed Point Computation
Highly Cited
1981
Highly Cited
1981
Analysis of a general recursive prediction error identification algorithm
  • L. Ljung
  • at - Automatisierungstechnik
  • 1981
  • Corpus ID: 31218764
Highly Cited
1976
Highly Cited
1976
Some Natural Properties of Strong-Identification in Inductive Inference
Highly Cited
1961
Highly Cited
1961
A minimal degree less than 0
Clifford Spector in [4] proved that there exists a minimal degree less than 0". J. R. Shoenfield in [3] asked: "Does there exist… 
1958
1958
Recursive equivalence types and combinatorial functions
Publisher Summary This chapter provides information on the Recursion theory that is originated as an ancillary of Hilbertian… 
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)