Timeline for Resources for mathematicians hoping to learn more computer science
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 20, 2013 at 11:44 | comment | added | András Salamon | My personal preference is for Kozen's Theory of Computation (quite mathematical in style, and with a larger coverage of logic and computability) over Sipser (which is much closer in style to an applied computer science book). | |
| May 20, 2013 at 9:31 | comment | added | Bruno | I wouldn't recommend the verbose Introduction to Algorithms. If one wishes to be introduced with the basic algorithmic techniques, I would recommend one of Algorithms by Dasgupta, Papadimitriou and Vazirani, Algorithm Design by Kleinberg and Tardos, or The Design and Analysis of Algorithms by Kozen. Introduction to the Theory of Computation by Sipser is an obviously great choice. I would also add some book on Computational Complexity (I find the ones by Papdimitriou, Arora and Barak, and Goldreich all excellent). | |
| May 19, 2013 at 19:16 | history | answered | Kevin A. Wortman | CC BY-SA 3.0 |