https://www.notion.so/wdesert/Curated-Resources-e37b0646f3f1...
This is a list I maintain for myself. It's more about general software development and is not as structured and focused as teachyourselfcs, but you mind find something useful in it
11–20 of 50 posts
https://www.notion.so/wdesert/Curated-Resources-e37b0646f3f1...
This is a list I maintain for myself. It's more about general software development and is not as structured and focused as teachyourselfcs, but you mind find something useful in it
The Stanford cryptography class ( http://crypto.stanford.edu/~dabo/cs255/ ) and associated book ( https://crypto.stanford.edu/~dabo/cryptobook/BonehShoup_0_4.... ) is almost everything you'd ever want to know about cryptography. If you really like that and want to see the frontiers of cryptography research, the next (and last!) class is https://crypto.stanford.edu/cs355/23sp/ ; alternatively, there's a security class…
taught by the creator of webtorrent afaik
Phenomenal look at different systems involved in a computer, and has you build simple versions of logic gates, ALU, assembler, compiler, bootloader, and graphics engine. Highly recommend for folks who didn't study CS in school.
[0] https://www.youtube.com/playlist?list=PLAqhIrjkxbuWI23v9cThs...
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.
[0] https://jvns.ca/blog/2023/04/17/a-list-of-programming-playgr...