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.
2019
2019
Blum-Shub-Smale machines are a classical model of computability over the real line. In [9], Koepke and Seyfferth generalised Blum… 
2019
2019
This article describes recent advances in the computation of the homology groups of semialgebraic sets. It summarizes a series of… 
2015
2015
We study the emergent dynamics for the hydrodynamic Cucker--Smale system arising in the modeling of flocking dynamics in… 
2012
2012
We introduce a generalization of Blum-Shub-Smale machines on the standard real numbers ℝ that is allowed to run for a transfinite… 
2011
2011
Working in the Blum-Shub-Smale model of computation on the real numbers, we answer several questions of Meer and Ziegler. First… 
Highly Cited
2010
Highly Cited
2010
The Cucker-Smale (CS) flocking model is an interacting particle system, in which each particle updates its velocity by adding to… 
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… 
1998
1998
Continuing the paper [7], in which the Blum‐Shub‐Smale approach to computability over the reals has been generalized to arbitrary… 
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… 
1979
1979
For orientation preserving diffeomorphisms on the torus necessary and sufficient conditions are given for an isotopy class to…