Song also proves Bieber is a dualist

"cause I'm missing more than just your body"

What else does she have that he misses?

Bieber in this case refers to body as in "corps", the subject's collective professional or military associations. He laments the loss of power he enjoyed stemming from the subject's erstwhile allegiance.

It's a heartfelt apology to the UN, but, as the article says, too late.

Dank memes. She has dank memes on her phone.

this subtree suggests HN has indeed become old.old.Reddit...

Or it proves he's not a necrophiliac. I mean, there are more ways to read that sentence.

You're not clocking it?

Her money?

Not this one:

https://drorspei.com/whatsmynumber

It's 100*10*4.5 inside, you're summing 100*9+100*8+...+100*1.

So 4.6min, i.e. 4:36

First, they give a novel generation algorithm based on combining trees with diffusion, which trees alone just don't give you.

Second, yes, they think some tabular data will be fit better by their combination of trees with diffusion than just with trees.

Is the code available somewhere?

I now use syncthing for the .git directory, excluding HEAD file and a few others, between my few devices and a vps on hetzner.

Most of git is append only immutable blobs - just sharing these between devices just works for me. "users" and authentication is handled by syncthing.

I have pre and post hooks to make sure no device tries to change HEAD of branch owned by another device, just to be safe, be it hasn't been activated once yet.

If you have a VPS that's always running, you can just use it as a git remote through SSH without moving things around or any third party software, just put the Git repo on the VPS and clone it via "git clone ssh://user@host/path". You get authentication, encryption and synchronization out of the box with just ssh/git.

Had to vouch for your comment, not sure why it was marked as dead.

Definitively the easiest way to approach this, and the most standard way too. If you already have ssh, which I'm guessing you do if you managed to setup syncthing on it in the first place, then you can literally just point git to host+path and it'll use whatever ssh authentication you already have in place.

Can hardly get simpler :)

I don't put ssh keys on all devices. With syncthing, in contrast to git, I don't have too.

Also syncing is automatic and immediate, I don't have to initiate push and pull.

Super interesting, mind sharing your exclusions and hooks?

For sure, I put the details here: https://drorspei.com/syncgit

I read the piece, looks cool, but it merges Dockerfile with docker image?

If instead of using Dockerfile they would have a direct build of the image tar file with something like nix then it would have been easier, though admittedly mildly esoteric

I've given the following exercise to developers in a few workplaces:

What's the complexity of computing the nth fibonacci number? Make a graph of computation time with n=1..300 that visualizes your answer.

There are those that very quickly reply linear but admit they can't get a graph to corroborate, and there are those that very quickly say linear and even produce the graph! (though not correct fibonacci numbers...)

Binet's (or Euler's or de Moivre's) formula for the nth Fibonacci number is (((sqrt(5)+1)/2)^n-(-(sqrt(5)+1)/2)^-n)/sqrt(5). Additions are O(n). Multiplications vary depending on the algorithm, the best known (Harvey-Hoeven) is O(n log(n)) but comes with some nasty constants that probably mean classic Karatsuba or Toom-Cook multiplication (O(n^1.X) for some X will be faster for the range to be graphed, but I'll stick with O(n log(n)) for this. The exponentials will be O(n log(n)^2) in the best known case IIRC. That factor dominates, so I'd say it's probably O(n log(n)^2) but that a graph probably won't start cooperating quickly due to the algorithms picked having factors that are ignored by big-O notation for the small inputs given.

However you do it it probably can't be linear, since multiplication is probably at best O(n log(n)), though that lower bound hasn't been proven. A naive recursive calculation will be even worse since that has exponential complexity.

words_on_lines = [ret for line in text.splitlines() for ret in [line.split()]]

Dask for python satisfies exactly these requirements, just in the python ecosystem. A pattern I have been using at multiple workplaces for the last decade was to start a dask cluster (maybe 10 years ago I would start an ipyparallel cluster) on any node that does computation, then as I needed I would spin new nodes and connect them. This gives dynamic infinite scalability, with almost no overhead or even code debt - the dask interfaces are great even without using distributed computing. When I wasn't allowed to use containers, I would sneakily add code to other machines to join my dask clusters. I would connect any and all computing devices. One company pushed us to use databricks and spark, and I never got it - why would we commit to a cluster size before we started a computation?