Login / Signup
A Necessary and Sufficient Condition for Embedding Ranked Finite Partial Lattices into the Computably Enumerable Degrees.
Manuel Lerman
Published in:
Ann. Pure Appl. Log. (1998)
Keyphrases
</>
sufficient conditions
asymptotic stability
inductive inference
lyapunov function
linear systems
vector space
finite number
exponential stability
linear complementarity problem
dynamic programming
recursive functions
equilibrium point
efficiently computable