Techie: I have written a short story, Manna, a cautionary tale. It begins with a burger restaurant rolling out an AI that talks into workers' headsets all day
Burger King: We're excited to announce Patty
marshallbrain.com/manna
was the intent to make WarClaude look awesome?
this is racist against my people
but it's also true hahaha ciao!
We had a good thing you stupid son of a bitch. We had COBOL, mainframes, a steady paycheck. Everything we needed. Ran like clockwork. But no, you had to be the man. Too good for unions. Now a model does your job. You and your pride and your '10x engineer' ego.
Python is good for getting an answer, true, but I use Julia when it matters if the answer is correct
can't handle all of this gen-z language anymore
plausible. maybe create a sub-process helper that runs a full major collection/compaction and then stands by as a pristine image ready to fork off of
I thought the button on Trump's desk orders diet coke
😅
ChatGPT and I have a very positive relationship
I assume if there's ever a war between Canada and The West, the Chinese Communist Party will eye the button on their desk that remote detonates every BYD.
oi, you got a loicense for that EDC knife?
cool meme but history isn’t a Marvel comic
pfft, I'm proudest of being an American when we knock off a dictator
Capturing a dictator whose legitimacy collapsed to the point that his opposition won a Nobel Peace Prize is good, actually
Yeah, it's definitely a... choice... to require flips and rotations and a sophisticated ranking to choose the best placement to clear the 3 examples but then accept *any* heuristic for the full data.
Most trolltacularly, this trivial fit test does *not* work on the example data but it does work on the full input!
I guess there were clues. Solving it the right way is NP-hard, but I thought a bin packing heuristic was worth trying -- which did work, just was a billion times slower.
Advent of OCaml, day 12 👹
**SPOILERS**
This ended up being a troll problem. You could get to work like a sap, do some best-fit bin packing heuristic and it'll take 1000 CPU minutes (✋)
Or you can ignore geometry entirely and pick trees whose area >= max-present-size * number-of-presents 🤦♂️
haha, an easter egg *without* a troll in it
there's an easter egg alright but it's not that
All hail the shape rotators!
nice. I'm just happy a computational solution is possible and it's not like yesterday's where you *cannot* solve it without integer linear programming
from r/adventofcode
Advent of OCaml, day 11, solved! 😼
A welcome reprieve from yesterday. Today's solution can be solved quickly with "merely" coding interview level DFS graph search with memoization.
so many of us are here 🫂
What I meant was, I first doubted using linear algebra libraries because I thought that was not what AOC wanted us to do. But then I changed my mind, because my dumb brute-force solution for part 1 took 5 minutes to run, and that probably also was not what AOC wants us to do 😅
Very nice. I've heard of multiple people using linear equations libraries to solve this now. That was my unexplored instinct also.
My vibe of AOC is that it shouldn't take these big guns to solve the problems but hey maybe they shouldn't take 5 minutes of naive CPU brute forcing either :P
okay I'm definitely throwing in the towel on this one. You win, AOC day 10 part 2
well, yolo_combinations definitely doesn't work for part 2
tried switching to BFS for part 2 and that solved some problems but not all. some have way too huge a search space
this has the shape of a linear algebra problem but I can't quite make the conceptual leap 🤔
