#ComputerScience
#CompSci #HowItStartedHowItsGoing #Meme
Edit: I was annoyed with how crappily low-resolution the imgflip version was (and how they use nearest-neighbor for scaling down their images!), so I recreated the meme entirely in #LibreOffice Draw, saved it at roughly 2.5 times the resolution of the original, and used #WebP compression to make it 1,029 bytes smaller than the original JPEG!! 💪
Impagliazzo's Five Worlds
https://www.youtube.com/watch?v=9Rs9_cIEbWY
"A Personal View of Average-Case Complexity" by R. Impagliazzo (1995)
Algorithmica: P = NP, Hard problems are easy to solve. Optimization is effortless.
Heuristica: NP is hard in the worst case, but easy on average.We can't prove problems are easy, but they usually are in practice.
Pessiland: Hard-on-average problems exist, but one-way functions do not.We can't solve problems, but we also can't do cryptography. The worst case.
Minicrypt: One-way functions exist. Private-key cryptography (AES, SHA) is possible, but public-key is not.
Cryptomania: Public-key cryptography is possible. Oblivious transfer and secure multi-party computation exist.
Not all the SDSU CompSci classes were completely valueless, I will admit, and at least being in that degree program allowed me to meet sci-fi writer (now departed) Vernor Vinge, who signed my copy of A Fire upon the Deep (which I eventually lost somewhere between moves). I took elective classes in #artificial_intelligence and learned some Common Lisp. But most of what I remember of the #compsci curriculum at SDSU in the 1990s was rather faddish, and I expect that's typical of most such curricula. I wasn't getting a well-structured and rigorous academic discipline; I was getting a collection of vocational exercises, learning how to use #programming tools that happened to be popular at the time. So I ended up doing a lot of C++ homework, and in my last term (when I hurriedly took a bunch of CS classes I'd been putting off because I was putting far more effort into my Classics curriculum) I had to do #Java homework, for a required "object-oriented programming" class.
Ah, #OOP. The very acronym suggests a blunder.
📜 Principal type-schemes for functional programs [1982]
By: L. Damas, R. Milner
📖 https://github.com/papers-we-love/papers-we-love/blob/master/languages-theory/principal-type-schemes-for-functional-programs.pdf
🔍 https://www.semanticscholar.org/paper/9c97b176ad594a24b923129218c5880a580fcb8b
I'm not as zealous as some who are putting stops on their updates.
I'll switch to forks as they become available.
I'm going to ride out this garbage the same way I rode out NFTs, CryptoScams, and various #CompSci helltrends. :/
Lord, I hate this timeline.
Wonderful:
“Celebrating Tony Hoare’s Mark On Computer Science”, Bertrand Meyer (https://bertrandmeyer.com/2026/03/16/celebrating-tony-hoares-mark-on-computer-science/).
Via HN: https://news.ycombinator.com/item?id=47422228
On Lobsters: https://lobste.rs/s/tr5qdg/celebrating_tony_hoare_s_mark_on_computer
#RIP #Obituary #ComputerScience #TonyHoare #CARHoare #CompSci #CS
Tony Hoare at the LASER summer school, September 2007 (All photographs in this article are by the author) Had they included just one of Tony Hoare’s major achievements, many scientific careers would be considered prestigious enough. His had a long list, which I am going to try to summarize, not pretending to get anywhere close ... Read more
R.L. Dane 
🍵 
Lobsters
lmorchard's links
ma𝕏pool
Mx. Chara Aznable (they/them) of Pnictogen
Papers We Love
रञ्जित (Ranjit Mathew)