Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,280,888 papers from all fields of science
Search
Sign In
Create Free Account
Μ operator
Known as:
Unbounded search operator
, Unbounded search
, M operator
Expand
In computability theory, the μ operator, minimization operator, or unbounded search operator searches for the least natural number with a given…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
11 relations
Broader (1)
Computability theory
Computable function
Counter machine
Lambda-mu calculus
Loop variant
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
Algebraic structures computable without delay
I. Kalimullin
,
A. Melnikov
,
K. Ng
Theoretical Computer Science
2017
Corpus ID: 19276458
2016
2016
Search space boundaries in neural network error landscape analysis
Anna Sergeevna Bosman
,
A. Engelbrecht
,
Mardé Helbig
IEEE Symposium Series on Computational…
2016
Corpus ID: 161343
Fitness landscape analysis encompasses a selection of techniques designed to estimate the properties of a search landscape…
Expand
2011
2011
Non-Deterministic Parallelism Considered Useful
D. Murray
,
S. Hand
USENIX Workshop on Hot Topics in Operating…
2011
Corpus ID: 15879393
The development of distributed execution engines has greatly simplified parallel programming, by shielding developers from the…
Expand
Highly Cited
2008
Highly Cited
2008
Bulk viscosity and spectral functions in QCD
G. Moore
,
O. Saremi
2008
Corpus ID: 16778687
We examine the behavior of the spectral function for the Tμμ operator in QCD in the two regimes where it is possible to make…
Expand
2007
2007
Directional Certainty in Sustainability-Oriented Innovation Management
Niko Paech
2007
Corpus ID: 55804278
What makes innovation representing a particular type of change, behaviour, or problem-solving, so ambivalent? An innovation’s…
Expand
2007
2007
Supporting MAS complex service modelling through agents substitutability
G. Pedone
,
László Zsolt Varga László
2007
Corpus ID: 56003856
In knowledge intensive domains the underlying information system is asked to provide a behaviour that match with highly-changea…
Expand
Highly Cited
2004
Highly Cited
2004
Real recursive functions and their hierarchy
Jerzy Mycka
,
José Félix Costa
Journal of Complexity
2004
Corpus ID: 1525971
Highly Cited
2001
Highly Cited
2001
A practical algorithm for making filled graphs minimal
J. Blair
,
P. Heggernes
,
J. A. Telle
Theoretical Computer Science
2001
Corpus ID: 6463801
1990
1990
Cognitive style and gender differences in children's motor task performance
C. Ennis
1990
Corpus ID: 49235128
Memory storage capacity and system flexibility of 7 year-old children were examined through performance on a novel ball…
Expand
Highly Cited
1978
Highly Cited
1978
Inverting and Minimalizing Path Sets and Cut Sets
M. O. Locks
IEEE Transactions on Reliability
1978
Corpus ID: 24114062
This paper describes a technique for generating the minimal cuts from the minimal paths, or vice versa, for s-coherent systems…
Expand
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)
ACCEPT & CONTINUE