<?xml version="1.0" encoding="UTF-8"?>
<!-- generator="FeedCreator 1.8" -->
<?xml-stylesheet href="https://wiki.computability.org/lib/exe/css.php?s=feed" type="text/css"?>
<rdf:RDF
    xmlns="http://purl.org/rss/1.0/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
    xmlns:dc="http://purl.org/dc/elements/1.1/">
    <channel rdf:about="https://wiki.computability.org/feed.php">
        <title>Computability theory</title>
        <description></description>
        <link>https://wiki.computability.org/</link>
        <image rdf:resource="https://wiki.computability.org/lib/tpl/bootstrap3/images/favicon.ico" />
       <dc:date>2026-05-09T13:46:45+00:00</dc:date>
        <items>
            <rdf:Seq>
                <rdf:li rdf:resource="https://wiki.computability.org/start?rev=1739355693&amp;do=diff"/>
                <rdf:li rdf:resource="https://wiki.computability.org/turing_degree?rev=1739355582&amp;do=diff"/>
            </rdf:Seq>
        </items>
    </channel>
    <image rdf:about="https://wiki.computability.org/lib/tpl/bootstrap3/images/favicon.ico">
        <title>Computability theory</title>
        <link>https://wiki.computability.org/</link>
        <url>https://wiki.computability.org/lib/tpl/bootstrap3/images/favicon.ico</url>
    </image>
    <item rdf:about="https://wiki.computability.org/start?rev=1739355693&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2025-02-12T10:21:33+00:00</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>Computability theory wiki</title>
        <link>https://wiki.computability.org/start?rev=1739355693&amp;do=diff</link>
        <description>Computability theory wiki

Welcome to the Computability theory wiki, a comprehensive resource dedicated to the study of computability and recursion theory. This wiki aims to provide clear and rigorous definitions of core terminology, as well as structured mini-courses to facilitate learning at different levels. See the</description>
    </item>
    <item rdf:about="https://wiki.computability.org/turing_degree?rev=1739355582&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2025-02-12T10:19:42+00:00</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>Turing degree</title>
        <link>https://wiki.computability.org/turing_degree?rev=1739355582&amp;do=diff</link>
        <description>Turing degree

The concept of Turing degree is fundamental in computability theory and provides a way to classify the relative complexity of undecidable problems. Two sets of natural numbers have the same Turing degree if they are Turing equivalent, meaning each can be computed from the other using a Turing machine with an oracle for the set.\( A \)\( \deg(A) \)\( A \)\( A \)\( B \)$$ A \leq_T B $$\( A \)\( B \)\( A \leq_T B \)\( B \leq_T A \)\( A \)\( B \)\( A \equiv_T B \)\( \leq_T \)\( \mathb…</description>
    </item>
</rdf:RDF>
