{
  "id": "enwiki-001298641139",
  "slug": "computably-inseparable",
  "title": "Computably inseparable",
  "qid": "",
  "lead": "In computability theory, two disjoint sets of natural numbers are called computably inseparable or recursively inseparable if they cannot be \"separated\" with a computable set. These sets arise in the study of computability theory itself, particularly in relation to \\Pi^0_1 classes. Computably inseparable sets also arise in the study of Gödel's incompleteness theorem.",
  "body": "In computability theory, two disjoint sets of natural numbers are called computably inseparable or recursively inseparable if they cannot be \"separated\" with a computable set. These sets arise in the study of computability theory itself, particularly in relation to \\Pi^0_1 classes. Computably inseparable sets also arise in the study of Gödel's incompleteness theorem. The natural numbers are the set \\mathbb{N} = \\{0, 1, 2, \\dots\\} . Given disjoint subsets A and B of \\mathbb{N} , a separating set C is a subset of \\mathbb{N} such that A \\subseteq C and B \\cap C = \\emptyset (or equivalently, A \\subseteq C and B \\subseteq C' , where C' = \\mathbb{N} \\setminus C denotes the complement of C ). For example, A itself is a separating set for the pair, as is B' . If a pair of disjoint sets A and B has no computable separating set, then the two sets are computably inseparable. Let \\varphi be the standard indexing of the partial computable functions. Then the sets A = \\{ e : \\varphi_e(0) = 0 \\} and B = \\{ e : \\varphi_e(0) = 1 \\} are computably inseparable (William Gasarch1998, p.&nbsp;1047). Let \\# be a standard Gödel numbering for the formulas of Peano arithmetic. Then the set A = \\{ \\#(\\psi) : PA \\vdash \\psi \\} of provable formulas and the set B = \\{ \\#(\\psi) : PA \\vdash \\lnot\\psi \\} of refutable formulas are computably inseparable. The inseparability of the sets of provable and refutable formulas holds for many other formal theories of arithmetic (Smullyan 1958).",
  "categories": [
    "23118434",
    "23603337",
    "26868936"
  ],
  "license": "CC BY-SA 4.0",
  "source_uri": "https://en.wikipedia.org/w/index.php?oldid=1298641139",
  "content_hash": "",
  "created_at": null,
  "updated_at": 1751562595.0,
  "claims": [],
  "contradictions": [],
  "confidence": 0.6,
  "csl": {
    "id": "enwiki-001298641139",
    "type": "webpage",
    "title": "Computably inseparable",
    "author": [
      {
        "family": "Anticloud FZ LLE",
        "literal": "Anticloud FZ LLE"
      }
    ],
    "container-title": "encyclopegia.org",
    "publisher": "Anticloud FZ LLE",
    "publisher-place": "Dubai, United Arab Emirates",
    "URL": "https://encyclopegia.org/a/computably-inseparable",
    "issued": {
      "date-parts": [
        [
          2026,
          11,
          17
        ]
      ]
    },
    "accessed": {
      "date-parts": [
        [
          2026,
          11,
          17
        ]
      ]
    },
    "license": "CC BY-SA 4.0",
    "DOI": "eo1:enwiki-001298641139",
    "isBasedOn": "https://en.wikipedia.org/w/index.php?oldid=1298641139",
    "note": "Immutable snapshot enwiki-001298641139"
  }
}