Constructing non-computable Julia sets - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Mark Braverman, Michael Yampolsky. Constructing non-computable Julia sets. In David S. Johnson, Uriel Feige, editors, Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007. pages 709-716, ACM, 2007. [doi]

The following publications are possibly variants of this publication:

Computability and complexity of Julia setsMark Braverman. PhD thesis, University of Toronto, Canada, 2008. [doi]

Computability of Julia SetsMark Braverman, Michael Yampolsky. Volume 23 of Algorithms and computation in mathematics, Springer, 2009.

Hyperbolic Julia Sets are Poly-Time ComputableMark Braverman. ENTCS, 120:17-30, 2005. [doi]

Filled Julia Sets with Empty Interior Are ComputableIlia Binder, Mark Braverman, Michael Yampolsky. focm, 7(4):405-416, 2007. [doi]

Computability and Complexity of Julia Sets (Invited Talk)Mark Braverman. cca 2009: [doi]

runs on WebDSL