![](/static/253f0d9b/assets/icons/icon-96x96.png)
![](https://lemmy.ml/pictrs/image/q98XK4sKtw.png)
Stuxnet would like a chat with you
Stuxnet would like a chat with you
Sounds like you should find a new product to use.
I will also go with 2013.
To be fair, this is a classical strategi in startups called “wizard of Oz prototyping” - it is used to test if there is a market for something before the tech is ready. But the tech is supposed to be created soon after and actually work…
Or was it pencils… So hard to remember…
Just like Tolkien wrote it.
Always has been
Well, according to the first biography about him, he was coding quite a lot in Zip2 and perhaps also some in early PayPal. Bit the code was supposedly hastily written and very bad.
I will give you an upvote for maintaining critical thinking, but I will say that the book is not that bad. And it is really well written and interesting, but might be favoring SBF more than other books. The truth is probably somewhere in the middle.
Read “Going Infinite” which describes the rise and tall of FTX and SBF. “isn’t smart” is not true, but he is definitely not “human smart”, but rather “math smart”.
Like pihole? I recently set it up and it is not blocking YouTube ads (as other commenters have also pointed out).
But I am guessing that you property price will also fall, så the question is what the new difference will be.
This is also my biggest missing feature.
I remember reading a Github issue about it and iirc it is a bit challenging to get it to work with federation.
Came here to say all of this, so thank you for saving me keystrokes :)
So if I take it I die at some point and if I don’t I also die at some point - I am not getting out of this alive, am I?
AI will probably benefit big corporations the most.
Let me take a stab at it:
Problem: Given two list of length n, find what elements the two list have in common. (we assume that there are not duplicates within a single list)
Naive solution: For each element in the first list, check if it appears in the second.
Bogo solution: For each permutation of the first list and for each permutation of the second list, check if the first item in each list is the same. If so, report in the output (and make sure to only report it once).