Edit this page Backlinks This page is read only. You can view the source, but not change it. Ask your administrator if you think this is wrong. ====== Examen optional ====== **Intrebarea 1:** * //Probleme si Masini Turing// * //Clase de probleme// **Intrebarea 2:** * //Probleme nedecidabile si reduceri// 2.1. O problema de decizie poate fi redusa la ea insasi ($math[f\leq_T f])? Justificati. 2.2. Fie doua probleme de decizie $math[f,g] reductibile-Turing una la cealalta. Care afirmatie este adevarata? * $math[f \in RE] * $math[g \in RE] * $math[f \in RE \implies g \in RE] * $math[g \in RE \implies f \in RE] 2.3. **Intrebarea 3:** * //Notatii asimptotice// * //Recurente// * //Complexitatea unor proceduri simple// **Intrebarea 4:** * //Quicksort si alti alg. de sortare// * //Analiza Amortizata// **Intrebarea 5:** * //Nedeterminism// * //SAT// * //Probleme NP-dure si NP-complete// **Intrebarea 6:** * //TDA-uri// * //Axiome pt TDA-uri//