Μ 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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
The theory of q-lattices represents a natural generalization of the lattice theory. We provide a characterization of fixed points… (More)
Is this relevant?
2012
2012
Machine to Machine (M2M) communication is the backbone of large-scale urban sensing, one of the enabling technologies of the… (More)
  • figure 1
  • table I
  • figure 2
  • table II
  • figure 3
Is this relevant?
2011
2011
The development of distributed execution engines has greatly simplified parallel programming, by shielding developers from the… (More)
  • figure 1
  • figure 2
Is this relevant?
2011
2011
Wireless sensor networks consist of a large number of sensor nodes having limited power. The most important feature of these… (More)
  • table 1
  • table 2
  • figure 1
  • table 3
  • table 4
Is this relevant?
2004
2004
ion, 3 active, 9 Ee, 42 algorithm r -separability, 52 A-separability, 32 N-Semiseparability, 160 semiseparability, 138… (More)
Is this relevant?
2003
2003
The photoinjector test facility at DESY Zeuthen (PITZ) produces electrons with a momentum of about 4–5 MeV/c. It is the aim to… (More)
Is this relevant?
2002
2002
We describe a complete methodology for the validation of rule-based expert systems. This methodology is presented as a five-step… (More)
  • figure 1
  • figure 2
  • table I
  • figure 3
  • figure 5
Is this relevant?
2001
2001
For an arbitrary lled graph G + of a given original graph G, we consider the problem of removing ll edges from G + in order to… (More)
  • figure 2
  • figure 4
Is this relevant?
2000
2000
  • Yanguang Lia
  • 2000
In this paper, we study a linearized two-dimensional Euler equation. This equation decouples into infinitely many invariant… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1968
1968
A tree automaton is a system (Q, f l , " " , fk , F) where Q is a set of states, f l , "" , fk are operations on Q of arbitrary… (More)
Is this relevant?