Skip to search formSkip to main contentSkip to account menu

Μ operator

Known as: Unbounded search operator, Unbounded search, M operator 
In computability theory, the μ operator, minimization operator, or unbounded search operator searches for the least natural number with a given… 
Wikipedia (opens in a new tab)

Related topics

Related topics

11 relations

Broader (1)

Computability theory
Computable functionCounter machineLambda-mu calculusLoop variant

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Search space boundaries in neural network error landscape analysis
Fitness landscape analysis encompasses a selection of techniques designed to estimate the properties of a search landscape… 
2012
2012
WSN sensor node for protected area monitoring
The article is dedicated to sensor node design focused on minimalization of energy consumption. The mote is proposed for low rate… 
2008
2008
Cooperative Search with Concurrent Interactions
In this paper we show how taking advantage of autonomous agents' capability to maintain parallel interactions with others, and… 
2007
2007
Directional Certainty in Sustainability-Oriented Innovation Management
What makes innovation representing a particular type of change, behaviour, or problem-solving, so ambivalent? An innovation’s… 
2007
2007
Supporting MAS complex service modelling through agents substitutability
In knowledge intensive domains the underlying information system is asked to provide a behaviour that match with highly-changea… 
2003
2003
Analysis of Surface Wave Attenuation in Mangrove Forests
This paper presents an analytical study on surface wave attenuation in mangrove forest using analytical model developed by Massel… 
Highly Cited
2001
Highly Cited
2001
A practical algorithm for making filled graphs minimal
2000
2000
On 2 D Euler equations . I . On the energy – Casimir stabilities and the spectra for linearized 2 D Euler equations
In this paper, we study a linearized two-dimensional Euler equation. This equation decouples into infinitely many invariant… 
1990
1990
Unbounded Searching Slgorithms
  • R. Beigel
  • SIAM journal on computing (Print)
  • 1990
  • Corpus ID: 33504914
The unbounded search problem was posed by Bentley and Yao. It is the problem of finding a key in a linearly ordered unbounded… 
Highly Cited
1978
Highly Cited
1978
Inverting and Minimalizing Path Sets and Cut Sets
This paper describes a technique for generating the minimal cuts from the minimal paths, or vice versa, for s-coherent systems… 
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)