Automata, Computability and Complexity
by Elaine A. Rich · first published 2007
2mentions
1recommended by
2HN commenters
2013–2023first – last mentioned
50% recommend50% neutral
Affiliate links. As an Amazon Associate I earn from qualifying purchases.
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…
on “Can we create a thread for some of the best materials on CS available online?” ↗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.…
on “Great Computer Science Lectures for all levels” ↗