Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 224,252,041 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.
2016
2016
On the P vs NP problem over reals with integer oracle
A. Rybalov
Dynamics of Systems, Mechanisms and Machines…
2016
Corpus ID: 24534429
Relativized complexity classes are actively studied in the computation complexity theory since 1975. Classical result of Baker…
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
2013
2013
Immersions of 3‐sphere into 4‐space associated with Dynkin diagrams of types A and D
Shumi Kinjo
2013
Corpus ID: 119686189
We construct two infinite sequences of immersions of the 3‐sphere into 4‐space, parameterized by the Dynkin diagrams of types A…
Expand
2011
2011
Orbifold Morse-Smale-Witten complex
Cheol-Hyun Cho
,
Hansol Hong
2011
Corpus ID: 119609704
We construct Morse-Smale-Witten complex for an effective orientable orbifold. For a global quotient orbifold, we also construct a…
Expand
2007
2007
Si’lnikov homoclinic orbits in a new chaotic system
Yongxin Jiang
,
Jianhua Sun
2007
Corpus ID: 14692087
2005
2005
The complexity of semilinear problems in succinct representation
Peter Bürgisser
,
F. Cucker
,
Paulin Jacobé de Naurois
Computational Complexity
2005
Corpus ID: 6137204
Abstract.We prove completeness results for twenty-three problems in semilinear geometry. These results involve semilinear sets…
Expand
2003
2003
A Direct Ultrametric Approach to Additive Complexity and the Shub-Smale Tau Conjecture
J. Rojas
arXiv.org
2003
Corpus ID: 60018
The Shub-Smale Tau Conjecture is a hypothesis relating the number of integral roots of a polynomial f in one variable and the…
Expand
1998
1998
Computability Over Structures of Infinite Signature
A. Hemmerling
Mathematical Logic Quarterly
1998
Corpus ID: 27747958
Continuing the paper [7], in which the Blum‐Shub‐Smale approach to computability over the reals has been generalized to arbitrary…
Expand
1997
1997
Homoclinic orbits and chaos in discretized perturbed NLS systems: Part II. Symbolic dynamics
Y. Li
,
S. Wiggins
1997
Corpus ID: 1896692
SummaryIn Part I ([9], this journal), Li and McLaughlin proved the existence of homoclinic orbits in certain discrete NLS systems…
Expand
1995
1995
Approximating the Volume of Deenable Sets
P. Koiran
1995
Corpus ID: 59266
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…
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