Live data from Hacker News

Can we create a thread for some of the best materials on CS available online?

news.ycombinator.com

11–20 of 50 posts

Re: Can we create a thread for some of the best materials on CS available online?

#11
teachyourselfcs is a perfect recommendation as it doesn't include a ton of links thus resulting in analysis paralysis.

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

Re: Can we create a thread for some of the best materials on CS available online?

#12
post #4

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…

another one application specific: https://www.youtube.com/playlist?list=PL1y1iaEtjSYiiSGVlL1cH...

taught by the creator of webtorrent afaik

Re: Can we create a thread for some of the best materials on CS available online?

#13
From Nand to Tetris: Build a Modern Computer from First Principles https://www.coursera.org/learn/build-a-computer

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.

Re: Can we create a thread for some of the best materials on CS available online?

#18
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.

Re: Can we create a thread for some of the best materials on CS available online?

#20
I have learned a tremendous amount about Linux and DNS and general computing from Julia Evans' zines and her blog. She's also a big fan of "programming playgrounds" [0] or interactive teaching tools.

[0] https://jvns.ca/blog/2023/04/17/a-list-of-programming-playgr...

Post reply on HN