Computably inseparable
id:
computably-inseparable-198-9901399
title:
Computably inseparable
text:
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 Π 1 0 classes. Computably inseparable sets also arise in the study of Gödel's incompleteness theorem.
brand slug:
wiki
category slug:
encyclopedia
description:
Concept in computability theory
original url:
https://en.wikipedia.org/wiki/Computably_inseparable
date created:
date modified:
2024-01-18T21:28:51Z
main entity:
{"identifier":"Q7303355","url":"https://www.wikidata.org/entity/Q7303355"}
image:
fields total:
13
integrity:
14