e/Blum-Shub-Smale machine

Information
has gloss	eng: In computation theory, the Blum-Shub-Smale machine, or BSS machine, is a model of computation introduced by Lenore Blum, Michael Shub and Stephen Smale, intended to describe computations over the real numbers. Essentially, a BSS machine is a Random Access Machine with registers that can store arbitrary real numbers and that can compute rational functions over reals at unit cost.
lexicalization	eng: Blum Shub Smale machine
lexicalization	eng: Blum-Shub-Smale machine
instance of	e/Computational model

Meaning
French
lexicalization	fra: Machine de Blum-Shub-Smale