Recursively enumerable subsets of Rq in two computing models: Blum-Shub-Smale machine and Turing machine

Authors:
Ning Zhong
Affiliations:
Univ. of Connecticut–Hartford, West Hartford
Venue:
Theoretical Computer Science
Year:
1998

Citing 0
Cited 7

Computing the Dimension of Linear Subspaces

SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics
The computational complexity of some julia sets

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Constructing non-computable Julia sets

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Hyperbolic Julia Sets are Poly-Time Computable

Electronic Notes in Theoretical Computer Science (ENTCS)
A Fast Algorithm for Julia Sets of Hyperbolic Rational Functions

Electronic Notes in Theoretical Computer Science (ENTCS)
Computability of julia sets by Mark Braverman and Michael Yampolsky, Publisher: Springer, 2009

ACM SIGACT News
The connection between computability of a nonlinear problem and its linearization: The Hartman-Grobman theorem revisited

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract