Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,276,762 papers from all fields of science
Search
Sign In
Create Free Account
Blum–Shub–Smale machine
Known as:
Blum Shub Smale machine
, Blum-Shub-Smale machine
, Blum Shub Smale
Expand
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
4 relations
Hypercomputation
Real RAM
Real computation
Toda's theorem
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Surreal Blum-Shub-Smale Machines
L. Galeotti
Conference on Computability in Europe
2019
Corpus ID: 109928451
Blum-Shub-Smale machines are a classical model of computability over the real line. In [9], Koepke and Seyfferth generalised Blum…
Expand
2019
2019
Recent Advances in the Computation of the Homology of Semialgebraic Sets
F. Cucker
Conference on Computability in Europe
2019
Corpus ID: 195795452
This article describes recent advances in the computation of the homology groups of semialgebraic sets. It summarizes a series of…
Expand
2018
2018
Flocking Dynamics of the Inertial Spin Model with a Multiplicative Communication Weight
Seung‐Yeal Ha
,
Doheon Kim
,
Dohyun Kim
,
Woojoo Shim
Journal of nonlinear science
2018
Corpus ID: 126379966
In this paper, we study a flocking dynamics of the deterministic inertial spin (IS) model. The IS model was introduced for the…
Expand
2015
2015
Emergent Dynamics for the Hydrodynamic Cucker-Smale System in a Moving Domain
Seung‐Yeal Ha
,
Moon-Jin Kang
,
Bongsuk Kwon
SIAM Journal on Mathematical Analysis
2015
Corpus ID: 33575499
We study the emergent dynamics for the hydrodynamic Cucker--Smale system arising in the modeling of flocking dynamics in…
Expand
2013
2013
Satisfiability of cross product terms is complete for real nondeterministic polytime Blum-Shub-Smale machines
C. Herrmann
,
Johanna Sokoli
,
M. Ziegler
Machines, Computations, and Universality
2013
Corpus ID: 11080902
Nondeterministic polynomial-time Blum-Shub-Smale Machines over the reals give rise to a discrete complexity class between NP and…
Expand
2012
2012
Towards a Theory of Infinite Time Blum-Shub-Smale Machines
P. Koepke
,
Benjamin Seyfferth
Conference on Computability in Europe
2012
Corpus ID: 41275783
We introduce a generalization of Blum-Shub-Smale machines on the standard real numbers ℝ that is allowed to run for a transfinite…
Expand
2011
2011
Noncomputable functions in the Blum-Shub-Smale model
W. Calvert
,
K. Kramer
,
Russell G. Miller
Log. Methods Comput. Sci.
2011
Corpus ID: 15314968
Working in the Blum-Shub-Smale model of computation on the real numbers, we answer several questions of Meer and Ziegler. First…
Expand
2007
2007
Si’lnikov homoclinic orbits in a new chaotic system
Yongxin Jiang
,
Jianhua Sun
2007
Corpus ID: 14692087
Highly Cited
2005
Highly Cited
2005
On the complexity of real functions
M. Braverman
IEEE Annual Symposium on Foundations of Computer…
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
Highly Cited
2004
Highly Cited
2004
Sub-quadratic convergence of a smoothing Newton algorithm for the P0– and monotone LCP
Zhenghai Huang
,
L. Qi
,
Defeng Sun
Mathematical programming
2004
Corpus ID: 3174525
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
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE