虽然它可能不是“最好”的，但这本书可以在作者网站上免费看。Elaine Rich 的教材《Automata, Computability and Complexity: Theory & Applications》https://www.cs.utexas.edu/~ear/cs341/automatabook/index.html，很实用，因为它涵盖了非确定性 Turing Machines 以及像 BPP、ZPP、RP 等复杂度类别，这些你在……
While it may not be the _best_ this book is available from the author online. Elaine Rich's textbook "Automata, Computability and Complexity: Theory & Applications" https://www.cs.utexas.edu/~ear/cs341/automatabook/index.html Useful because it covers non-deterministic Turing Machines complexity classes like BPP,ZPP,RP,etc.. that you would…
I agree - the automata, computability, and complexity course I took at university was both eye-opening and fun. I'd recommend a course in discrete mathematics beforehand. Furthermore, most CS grads I know would benefit from some statistics knowledge.…
虽然它可能不是“最好”的，但这本书可以在作者网站上免费看。Elaine Rich 的教材《Automata, Computability and Complexity: Theory & Applications》https://www.cs.utexas.edu/~ear/cs341/automatabook/index.html，很实用，因为它涵盖了非确定性 Turing Machines 以及像 BPP、ZPP、RP 等复杂度类别，这些你在……
While it may not be the _best_ this book is available from the author online. Elaine Rich's textbook "Automata, Computability and Complexity: Theory & Applications" https://www.cs.utexas.edu/~ear/cs341/automatabook/index.html Useful because it covers non-deterministic Turing Machines complexity classes like BPP,ZPP,RP,etc.. that you would…
我同意——我在大学里学的那门自动机、可计算性与复杂度课程既让人大开眼界又很有意思。我建议先修一门离散数学。此外，我认识的大多数 CS 毕业生如果懂点统计学都会受益匪浅。……
I agree - the automata, computability, and complexity course I took at university was both eye-opening and fun. I'd recommend a course in discrete mathematics beforehand. Furthermore, most CS grads I know would benefit from some statistics knowledge.…