……按照我自己的口味，这里有一份更有意思的书单。可能其中有些已经在列表里了，但我翻到一定程度后也很难再继续往下刷了：- 《Expert C Programming: Deep C Secrets》- 《The Nature of Computation》- 《The Little Schemer》- 《Programming Pearls》
…Here's a more fun reading list, based off my own tastes. Maybe some of these are on the list, but I found it hard to scroll past a certain point as well: - Expert C Programming: Deep C Secrets - The Nature of Computation - The Little Schemer - Programming Pearls
我希望自己当初能由此入门的书：《The Nature of Computation》- Moore, Mertens 我当年读的（研究生课程）：《Graph Theory》- Reinhard Diestel 一本更百科全书式的著作（收录了大部分重大成果，无证明）：《Handbook of Graph Theory》- Gross, Yellen
The place I wish I had started at: The Nature of Computation - Moore, Mertens What I got (graduate coursework): Graph Theory - Reinhard Diestel A more encyclopedic treatment (most big results, no proofs): Handbook of Graph Theory - Gross, Yellen
Here are some great books which are meant to be read (and have not been mentioned elsewhere in this thread, i.e. Axler and Pugh). Algebra: Chapter 0 by Paolo Aluffi Measurement by Paul Lockhart The Nature of Computation by Moore & Mertens Ideals, Varieties, and Algorithms by Cox, Little, & O'Shea
……在基础层面全面覆盖抽象概念这一点上，真没有什么书能与之媲美，而且你迟早会需要类似的东西。我简直爱死 Moore & Mertens 的《The Nature of Computation》了；对于零基础（但有数学思维）的初学者来说，这大概是唯一一本能把计算理论讲得极其引人入胜且清晰透彻的书了（同时还涵盖了相当大体量的……
…There isn't really anything that compares in terms of its comprehensive coverage of abstraction at the basic level, and you'll eventually need something like it. I simply love Moore & Merten's "The Nature of Computation"; it's probably the only book for the absolute (but mathematically-minded) beginner about the theory of computation that manages to be incredibly captivating and lucid (while also covering a significant…
……1994 年的一本经典是 Papadimitriou 的《Computational Complexity》。近 25 年来较新资料的两个好来源是 Arora 和 Barak 的《Complexity Theory: A Modern Approach》，以及 Mertens 和 Moore 的《The Nature of Computation》。我个人极其偏爱的一本小众佳作是 Uwe Schoning 的《Gems of Theoretical Computer Science》。
…classic from 1994 is "Computational Complexity" by Papadimitriou. Two good sources for newer material (from the past quarter-century) are "Complexity Theory: A Modern Approach" by Arora and Barak, and "The Nature of Computation" by Mertens and Moore. A personal, idiosyncratic favorite is "Gems of Theoretical Computer Science" by Uwe Schoning.
可能比你想找的稍微进阶一点，但我很想推荐 Cristopher Moore 和 Stephan Mertens 写的《The Nature of Computation》作为下一步的读物。这本书读起来太有意思了，里面有大量的思考题和习题。http://nature-of-computation.org/
Probably a little more advanced than what you are looking for but I would like to recommend The Nature of Computation by Cristopher Moore and Stephan Mertens as a next step. It is such a fun book to read, with a lot of problems and exercises. http://nature-of-computation.org/
……按照我自己的口味，这里有一份更有意思的书单。可能其中有些已经在列表里了，但我翻到一定程度后也很难再继续往下刷了：- 《Expert C Programming: Deep C Secrets》- 《The Nature of Computation》- 《The Little Schemer》- 《Programming Pearls》
…Here's a more fun reading list, based off my own tastes. Maybe some of these are on the list, but I found it hard to scroll past a certain point as well: - Expert C Programming: Deep C Secrets - The Nature of Computation - The Little Schemer - Programming Pearls
我希望自己当初能由此入门的书：《The Nature of Computation》- Moore, Mertens 我当年读的（研究生课程）：《Graph Theory》- Reinhard Diestel 一本更百科全书式的著作（收录了大部分重大成果，无证明）：《Handbook of Graph Theory》- Gross, Yellen
The place I wish I had started at: The Nature of Computation - Moore, Mertens What I got (graduate coursework): Graph Theory - Reinhard Diestel A more encyclopedic treatment (most big results, no proofs): Handbook of Graph Theory - Gross, Yellen
这里推荐几本真正值得去读的好书（而且本帖其他地方还没提到过，比如没提 Axler 和 Pugh）。Paolo Aluffi 的《代数：第0章》；Paul Lockhart 的《度量》；Moore 和 Mertens 的《计算的本质》；Cox、Little 和 O'Shea 的《理想、簇与算法》
Here are some great books which are meant to be read (and have not been mentioned elsewhere in this thread, i.e. Axler and Pugh). Algebra: Chapter 0 by Paolo Aluffi Measurement by Paul Lockhart The Nature of Computation by Moore & Mertens Ideals, Varieties, and Algorithms by Cox, Little, & O'Shea
……在基础层面全面覆盖抽象概念这一点上，真没有什么书能与之媲美，而且你迟早会需要类似的东西。我简直爱死 Moore & Mertens 的《The Nature of Computation》了；对于零基础（但有数学思维）的初学者来说，这大概是唯一一本能把计算理论讲得极其引人入胜且清晰透彻的书了（同时还涵盖了相当大体量的……
…There isn't really anything that compares in terms of its comprehensive coverage of abstraction at the basic level, and you'll eventually need something like it. I simply love Moore & Merten's "The Nature of Computation"; it's probably the only book for the absolute (but mathematically-minded) beginner about the theory of computation that manages to be incredibly captivating and lucid (while also covering a significant…
……1994 年的一本经典是 Papadimitriou 的《Computational Complexity》。近 25 年来较新资料的两个好来源是 Arora 和 Barak 的《Complexity Theory: A Modern Approach》，以及 Mertens 和 Moore 的《The Nature of Computation》。我个人极其偏爱的一本小众佳作是 Uwe Schoning 的《Gems of Theoretical Computer Science》。
…classic from 1994 is "Computational Complexity" by Papadimitriou. Two good sources for newer material (from the past quarter-century) are "Complexity Theory: A Modern Approach" by Arora and Barak, and "The Nature of Computation" by Mertens and Moore. A personal, idiosyncratic favorite is "Gems of Theoretical Computer Science" by Uwe Schoning.
可能比你想找的稍微进阶一点，但我很想推荐 Cristopher Moore 和 Stephan Mertens 写的《The Nature of Computation》作为下一步的读物。这本书读起来太有意思了，里面有大量的思考题和习题。http://nature-of-computation.org/
Probably a little more advanced than what you are looking for but I would like to recommend The Nature of Computation by Cristopher Moore and Stephan Mertens as a next step. It is such a fun book to read, with a lot of problems and exercises. http://nature-of-computation.org/