{
  "id": "1404.1236",
  "version": "v1",
  "published": "2014-04-04T12:45:04.000Z",
  "updated": "2014-04-04T12:45:04.000Z",
  "title": "Poly-time Computability of the Feigenbaum Julia set",
  "authors": [
    "Artem Dudko",
    "Michael Yampolsky"
  ],
  "categories": [
    "math.DS"
  ],
  "abstract": "We present the first example of a poly-time computable Julia set with a recurrent critical point: we prove that the Julia set of the Feigenbaum map is computable in polynomial time.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2014-04-04T12:45:04.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "37F25",
      "03D15"
    ],
    "keywords": [
      "feigenbaum julia set",
      "poly-time computability",
      "poly-time computable julia set",
      "first example",
      "feigenbaum map"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2014arXiv1404.1236D"
    }
  }
}