Skip to search formSkip to main contentSkip to account menu

Blum–Shub–Smale machine

Known as: Blum Shub Smale machine, Blum-Shub-Smale machine, Blum Shub Smale 
In computation theory, the Blum–Shub–Smale machine, or BSS machine, is a model of computation introduced by Lenore Blum, Michael Shub and Stephen… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
  • A. Rybalov
  • 2016
  • Corpus ID: 24534429
Relativized complexity classes are actively studied in the computation complexity theory since 1975. Classical result of Baker… 
2013
2013
Nondeterministic polynomial-time Blum-Shub-Smale Machines over the reals give rise to a discrete complexity class between NP and… 
2013
2013
We construct two infinite sequences of immersions of the 3‐sphere into 4‐space, parameterized by the Dynkin diagrams of types A… 
2011
2011
We construct Morse-Smale-Witten complex for an effective orientable orbifold. For a global quotient orbifold, we also construct a… 
2005
2005
Abstract.We prove completeness results for twenty-three problems in semilinear geometry. These results involve semilinear sets… 
2003
2003
The Shub-Smale Tau Conjecture is a hypothesis relating the number of integral roots of a polynomial f in one variable and the… 
1998
1998
Continuing the paper [7], in which the Blum‐Shub‐Smale approach to computability over the reals has been generalized to arbitrary… 
1997
1997
SummaryIn Part I ([9], this journal), Li and McLaughlin proved the existence of homoclinic orbits in certain discrete NLS systems… 
1995
1995
The rst part of this paper deals with nite-precision arithmetic. We give an upper bound on the precision that should be used in a…