Editing Computable set (section)

==Examples==
*Every [[recursive language]] is a computable.
*Every finite or [[cofinite]] subset of the natural numbers is computable.
**The [[empty set]] is computable.
**The entire set of natural numbers is computable.
**Every natural number is computable.<ref group="note" name="set-natural-number"/>
*The subset of [[prime number]]s is computable.
*The set of Gödel numbers is computable.<ref group="note" name="Gödel-numbers"/>

===Non-examples===
{{Main|List of undecidable problems}}
*The set of [[Halting problem|Turing machines that halt]] is not computable.
*The set of pairs of [[homeomorphism|homeomorphic]] finite [[simplicial complex]]es is not computable.<ref>{{cite journal
 | last = Markov | first = A.
 | journal = Doklady Akademii Nauk SSSR
 | mr = 97793
 | pages = 218–220
 | title = The insolubility of the problem of homeomorphy
 | volume = 121
 | year = 1958}}</ref>
*The set of [[Busy beaver#Non-computability|busy beaver champions]] is not computable.
*[[Hilbert's tenth problem]] is not computable.