文章列表

• 1.计算理论 21-NP-completeness
• ...
• 2.计算理论 20-P, NP and Polynomial-time Reductions
• ...
• 3.计算理论 19-Uncomputable functions and Intro to Complexity
• ...
• 4.计算理论 18-More Complex Reductions
• ...
• 5.计算理论 17-Using Reductions to Prove Language Undecidable
• ...
• 6.计算理论 16-Unrecognizable Languages and Reductions
• ...
• 7.计算理论 15-Proof by Diagonalization that ATM (Halting Prob) is not Decidable
• ...
• 8.计算理论 14-More Diagonalization: Proof that Turing Machines are Countable
• ...
• 9.计算理论 13-Diagonalization, Countability and Uncountability
• ...
• 10.计算理论 12-Universal Turing Machines: The Halting Prob is Recognizable but not Decidable
• ...