News for hackers. Stuff that matters.
Re:Can we create a thread for some of the best materials on ... by nyrikki on Friday May 26, 2023 @04:58PM (#36089432)
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 run into Monte Carlo methods etc. As the only Non-deterministic Turing machine most people have been introduced to is the maximally lucky guesser from NP's definition it can help with practical solutions.

Unfortunately it doesn't have bounded-error quantum polynomial time (BQP) which would help set expectations for quantum supremacy.

There are no comments on this comment yet.