{
  "id": "math/0610340",
  "version": "v2",
  "published": "2006-10-10T19:09:26.000Z",
  "updated": "2007-09-29T21:16:04.000Z",
  "title": "Computability of Julia sets",
  "authors": [
    "Mark Braverman",
    "Michael Yampolsky"
  ],
  "comment": "Revised. To appear in Moscow Math. Journal",
  "categories": [
    "math.DS"
  ],
  "abstract": "In this paper we settle most of the open questions on algorithmic computability of Julia sets. In particular, we present an algorithm for constructing quadratics whose Julia sets are uncomputable. We also show that a filled Julia set of a polynomial is always computable.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2007-09-29T21:16:04.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "37F50"
    ],
    "keywords": [
      "filled julia set",
      "open questions",
      "algorithmic computability",
      "constructing quadratics"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2006math.....10340B"
    }
  }
}