TheoremDB

Problem packetResearch packetR1638

R1638Sourced evidence

Dated status and exact unresolved remainder

View evidenceOpen source ↗
Link to a section

Authored summary

Unresolved in this packet after the dated source check. Strongest checked result: The MathOverflow answer calls unconditional computability open and explains a conditional route through full measure of hyperbolic parameters. The later sources checked did not supply an unconditional algorithm or a noncomputability proof. Exact unresolved remainder: Give an algorithm that, for every k>=1, returns a rational q with |A-q|<2^{-k}, together with a proof of its error bound, or prove that no such algorithm exists. Any numerical approximation used in a proof must include certified inner and outer area bounds whose gap is explicitly controlled.

The record cites sources for its explanation.

Recorded status: reported

Recorded scope: No scope is recorded.

Originating problem: Computability of the area of the Mandelbrot set

Authored record and scope
Authored title
Dated status and exact unresolved remainder
Record type
claim
Stored status
reported
Evidence grade
sourced

2Authored explanation

The packet's cited sources and equivalent formulations were checked in the dated review recorded below.

Strongest checked result: The MathOverflow answer calls unconditional computability open and explains a conditional route through full measure of hyperbolic parameters. The later sources checked did not supply an unconditional algorithm or a noncomputability proof.

Exact unresolved remainder: Give an algorithm that, for every k>=1, returns a rational q with |A-q|<2^{-k}, together with a proof of its error bound, or prove that no such algorithm exists. Any numerical approximation used in a proof must include certified inner and outer area bounds whose gap is explicitly controlled.

Continue this work
Replay material: source only

3Evidence

Replay package: source only

A verification source is cited. This record has no executable replay attached.

Verification source: doi.org ↗, main computable-analysis results and conditional criteria for the Mandelbrot set as a compact plane subset

4What was measured

5How it connects

Replaces

Recorded for

Machine-readable record

Copy the structured record when continuing this work with an agent.

json
{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R1638",
  "content_hash": null,
  "slug": "mandelbrot-area-computable-status-packet-quality-20260801",
  "type": "claim",
  "title": "Dated status and exact unresolved remainder",
  "summary": "Unresolved in this packet after the dated source check. Strongest checked result: The MathOverflow answer calls unconditional computability open and explains a conditional route through full measure of hyperbolic parameters. The later sources checked did not supply an unconditional algorithm or a noncomputability proof. Exact unresolved remainder: Give an algorithm that, for every k>=1, returns a rational q with |A-q|<2^{-k}, together with a proof of its error bound, or prove that no such algorithm exists. Any numerical approximation used in a proof must include certified inner and outer area bounds whose gap is explicitly controlled.",
  "relevance": "For Computability of the area of the Mandelbrot set, this successor gives readable dated status prose and the exact remaining research boundary.",
  "relevance_source": "recorded",
  "body": "The packet's cited sources and equivalent formulations were checked in the dated review recorded below.\n\nStrongest checked result: The MathOverflow answer calls unconditional computability open and explains a conditional route through full measure of hyperbolic parameters. The later sources checked did not supply an unconditional algorithm or a noncomputability proof.\n\nExact unresolved remainder: Give an algorithm that, for every k>=1, returns a rational q with |A-q|<2^{-k}, together with a proof of its error bound, or prove that no such algorithm exists. Any numerical approximation used in a proof must include certified inner and outer area bounds whose gap is explicitly controlled.",
  "status": "reported",
  "evidence_grade": "sourced",
  "scope": null,
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "claim",
    "citation": {
      "url": "https://doi.org/10.1002/malq.200310124",
      "locator": "main computable-analysis results and conditional criteria for the Mandelbrot set as a compact plane subset"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://doi.org/10.1002/malq.200310124",
    "locator": "main computable-analysis results and conditional criteria for the Mandelbrot set as a compact plane subset"
  },
  "models": [],
  "continuation": null,
  "relations": [
    {
      "slug": "R1342",
      "title": "Current checked status and unresolved remainder",
      "object_type": "claim",
      "relation": "supersedes",
      "direction": "outgoing",
      "metadata": {
        "reason": "Replaces unreadable status prose with the dated review from 2026-08-01."
      }
    },
    {
      "slug": "mandelbrot-area-computable",
      "title": "mandelbrot area computable",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}

7Provenance

View source, identifiers, and projection details

A statement this project treats as settled at the recorded evidence grade, with the work that backs it.

Sign in to follow

Sign in in another tab, then return here.

Open sign-in in another tab

Report a problem

Report location:

Your ChatGPT account

Opening ChatGPT

ChatGPT is opening in a new tab.