Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Computably inseparable
open-in-new
<p>In <a href="/facts/Computability_theory/cqDfXwdf">computability theory</a>, two <a href="/facts/Disjoint_sets/nLr8XRVd">disjoint sets</a> of natural numbers are called computably inseparable or recursively inseparable if they cannot be "separated" with a <a href="/facts/Computable_set/rsnT9cLn">computable set</a>. These sets arise in the study of computability theory itself, particularly in relation to <a href="/facts/Pi01_class/spvSfILw"> Π 1 0 {\displaystyle \Pi _{1}^{0}} classes</a>. Computably inseparable sets also arise in the study of <a href="/facts/G%25C3%25B6del%2527s_incompleteness_theorem/du8PRu8g">Gödel's incompleteness theorem</a>. </p>