Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Blum-Shub-Smale machines are a classical model of computability over the real line. In [9], Koepke and Seyfferth generalised Blum… Expand
2019
2019
This article describes recent advances in the computation of the homology groups of semialgebraic sets. It summarizes a series of… Expand
2015
2015
We study the emergent dynamics for the hydrodynamic Cucker--Smale system arising in the modeling of flocking dynamics in… Expand
2012
2012
We introduce a generalization of Blum-Shub-Smale machines on the standard real numbers ℝ that is allowed to run for a transfinite… Expand
Highly Cited
2007
Highly Cited
2007
AbstractIsolated multiple zeros or clusters of zeros of analytic maps with several variables are known to be difficult to locate… Expand
  • table 1
  • table 2
  • table 3
  • table 5
  • table 6
Highly Cited
2005
Highly Cited
2005
  • M. Braverman
  • 46th Annual IEEE Symposium on Foundations of…
  • 2005
  • Corpus ID: 5782147
We establish a new connection between the two most common traditions in the theory of real computation, the Blum-Shub-Smale model… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Highly Cited
2004
Highly Cited
2004
Abstract.Given , the linear complementarity problem (LCP) is to find such that (x, s)≥ 0,s=Mx+q,xTs=0. By using the Chen-Harker… Expand
  • table 1
1998
1998
  • Ning Zhong
  • Theor. Comput. Sci.
  • 1998
  • Corpus ID: 44635651
Abstract In this paper we compare recursively enumerable subsets of Rq in two computing models over real numbers: the Blum-Shub… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
1998
1998
Continuing the paper [7], in which the Blum-Shub-Smale approach to computability over the reals has been generalized to arbitrary… Expand
Highly Cited
1996
Highly Cited
1996
We estimate the probability that a given number of projective Newton steps applied to a linear homotopy of a system of n… Expand