Matin D . Davis , Computability, Complexity, and Languages, Academic Press, 1983.
《可計算性 、 復(fù)雜性和語言》, 清華大學(xué)出版社,北京, 1989.
互聯(lián)網(wǎng)
A more extensive and theoretical treatment of the material in 18.400 J, Automata , Computability, and Complexity computabilitytheory.
本課程比18.400J[自動機, 可計算性和復(fù)雜性]涉及面更廣、更理論化.
互聯(lián)網(wǎng)
For a more advanced graduate course, computability theory and computational complexity theory are also covered.
高級課程中還包括了可計算理論和計算復(fù)雜性理論.
互聯(lián)網(wǎng)