<?xml version="1.0" encoding="utf-8"?>
<!-- generator="FeedCreator 1.7.2-ppt DokuWiki" -->
<?xml-stylesheet href="https://ocw.cs.pub.ro/ppcarte/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://ocw.cs.pub.ro/ppcarte/feed.php">
        <title>books aa:exam:29ian</title>
        <description></description>
        <link>https://ocw.cs.pub.ro/ppcarte/</link>
        <image rdf:resource="https://ocw.cs.pub.ro/ppcarte/lib/tpl/bootstrap3/images/favicon.ico" />
       <dc:date>2026-05-03T12:57:08+03:00</dc:date>
        <items>
            <rdf:Seq>
                <rdf:li rdf:resource="https://ocw.cs.pub.ro/ppcarte/doku.php?id=aa:exam:29ian:asdf&amp;rev=1611826891&amp;do=diff"/>
            </rdf:Seq>
        </items>
    </channel>
    <image rdf:about="https://ocw.cs.pub.ro/ppcarte/lib/tpl/bootstrap3/images/favicon.ico">
        <title>books</title>
        <link>https://ocw.cs.pub.ro/ppcarte/</link>
        <url>https://ocw.cs.pub.ro/ppcarte/lib/tpl/bootstrap3/images/favicon.ico</url>
    </image>
    <item rdf:about="https://ocw.cs.pub.ro/ppcarte/doku.php?id=aa:exam:29ian:asdf&amp;rev=1611826891&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2021-01-28T11:41:31+03:00</dc:date>
        <title>aa:exam:29ian:asdf</title>
        <link>https://ocw.cs.pub.ro/ppcarte/doku.php?id=aa:exam:29ian:asdf&amp;rev=1611826891&amp;do=diff</link>
        <description>Examen optional

Intrebarea 1:

	*  Probleme si Masini Turing
	*  Clase de probleme

1.1. Fie $ M_1$  si $ M_2$  doua Masini Turing care accepta Halting Problem ($ f_h$ ). Care afirmatie este adevarata?

	*  exista un cuvant $ w$  pentru care $ M_1$  sau $ M_2$  cicleaza
	*  daca $ M_1$  cicleaza pt un cuvant $ w$$ M_2$$ w$$ f_h \in R$$ M_1$$ M_2$$ M$$ F = \{f \in \mathbb{H}om(\Sigma^*,\{0,1\}) \mid M \text{ accepta } f\}$$ F \subseteq R$$ F \cap RE = \emptyset$$ F$$ F$$ \Sigma^*, \mathcal{M} = …</description>
    </item>
</rdf:RDF>
