可计算性、复杂性与语言
Computability, complexity, and languages
Davis, Martin · 初版 1983 年
1人推荐
2位读者提及
2次提及
这本导论性教材涵盖了计算机科学的核心领域，包括递归函数论、形式语言和自动机。本书对形式数学背景的要求极低。全书共分为五个部分：Computability、Grammars and Automata、Logic、Complexity以及Unsolvability。
Hacker News 上怎么说
正在加载完整评论……
……(http://www.amazon.com/Introduction-Algorithms-Second-Thomas-...) 《The Art of Computer Programming》(http://www.amazon.com/s/ref=nb_sb_ss_i_6_31?url=search-alias...) ……这些算是入门。然后还有理论计算机科学的书。我很喜欢《Computability, Complexity, and Languages, Second Edition: Fundamentals of Theoretical Computer Science (Computer Science and Scientific Computing)》http://www.amazon.com/Computability-Complexity-Languages-Sec...
…(http://www.amazon.com/Introduction-Algorithms-Second-Thomas-...) "The Art of Computer Programming" (http://www.amazon.com/s/ref=nb_sb_ss_i_6_31?url=search-alias...) ....to begin with. Then there are theoretical computer science books. I like the Computability, Complexity, and Languages, Second Edition: Fundamentals of Theoretical Computer Science (Computer Science and Scientific Computing) http://www.amazon.com/Computability-Complexity-Languages-Sec...
S 语言是 Martin Davis 在他的《Computability, Complexity and Languages》一书中提出的一种理论编程语言。它由标签、变量和 4 条基本指令构成，它的众多用途之一是用来证明存在不可计算的自然函数（F: N^n -> N）。太牛了！如果你想……
The S language is a theoretical programming language proposed by Martin Davids in his book Computability, Complexity and Languages. It is composed by labels, variables, and 4 basic instructions, and its used between many things, to prove that there are natural functions (F: N^n -> N) which can not be computed. Awesome! If you want…