Computability of julia sets by Mark Braverman and Michael Yampolsky, Publisher: Springer, 2009

Authors:
Wesley Calvert
Affiliations:
-
Venue:
ACM SIGACT News
Year:
2010

Citing 2
Cited 0

Complexity and real computation

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

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract