JZumun

It's really quite cool how we can implicitly know all these linguistic rules without consciously being aware of them. Just another reminder that our conscious self is just a layer on top of a big and complex processing machine.

I think they added multi-page support in the previous point release[0]. I only use inkscape to make graphics though, so I'm not sure how user friendly the implementation is.

[0] https://inkscape.org/news/2022/05/16/inkscape-12/

I think the badge isn't for the reaction, but for posting comments whose text is solely "+1" or "<thumbs up emoji>"

Cryptic crosswords usually provide the lengths of each word in the solution as part of the clue. If that were done here it would have spoiled the ambiguity because either answer would have had (3,4,7) or (7,7) in the clue.

I think this site probably deals more with the cryptic crosswords, so that aside probably made more sense for regular readers.

  { [Key in KeysType]-?: ... }

TIL that you can disable ? and readonly in mapped types using -. So in the above code, every Key will be mandatory (-?) even if the original one in KeysType was optional.

source: https://www.typescriptlang.org/docs/handbook/2/mapped-types....

In this formulation, isn't p^N the probability that ALL places where life is possible, actually has life? It makes sense for that to approach zero.

What we want is the probability for at least one other place other than ours to have life. This would be 1 - (1-p)^N, which does tend to 1 as N gets arbitrarily large.

To get that formula: (1-p) is the probability that life does not exist in a place, so (1-p)^N is the probability that ALL places where life is possible, has no life. Therefore, 1-(1-p)^N is the probability of the opposite of that (where at least one place has life).

I think an extreme example might help: if there are 100 software developers but 98 are single, and 2 are married to each other, then 100% of software developers(that are married couples) have married software developers, even if only 2% of all software developers are married at all.

Modern browsers partition caches by site nowadays - at least, Chrome started doing it last year[0], and Firefox followed soon after I think [1]. That means there's no longer any caching benefit for multiple websites using jQuery - each site will download and cache it separately.

[0] https://developers.google.com/web/updates/2020/10/http-cache...

[1] https://developer.mozilla.org/en-US/docs/Web/Privacy/State_P...

When I read about Peano axioms I mentally think of Sn as the function S(n) = n+1 and that helps me understand them better.

As a non mathematician sometimes I wonder if this substitution is causing me to misunderstand something else about them.

You can never go faster than c, so you can never reach anything that's being moved faster away.

(Assuming space expands evenly) we don't notice the expansion of space inside objects because the electromagnetism and gravity are vastly more powerful on the scales we care about and nullifies the effect. That's why atoms and galaxies in the Local Group stay together, but everything farther away is flying further away.

If expansion never stops accelerating, one day in the far future it will overcome all the other fundamental forces and everything will be torn apart in a Big Rip.

According to petite-vue's readme, it supports the `v-cloak` directive [0], which is how vue recommends you hide the unprocessed template before it is mounted.

For more complicated logic, I think working with the @mounted event might work.

[0] https://v3.vuejs.org/api/directives.html#v-cloak

This reminds me of how Adobe Photoshop branding guidelines [1] explicitly forbid the use of "photoshop" as a verb or common noun, and yet I don't think anyone considers these to be improper English grammar.

1: https://www.adobe.com/legal/permissions/trademarks.html

It's like a recursive function, where you resolve to stop interfering with the lower universe once the upper universe stops interfering with you. You run it N times until nothing happens in your universe. That means you're N universes deep in the stack.

If you run the program once and not observe anything happening, that means you know you're top level. Then you resolve to not rerun the program.

If you run the program once and observe the black sphere, then run it again and not see the black sphere, you know you're level 2. You resolve to not rerun the program. And on it goes.

EDIT: box to sphere.

> for (let elem : arr) { ... }

Do you mean:

  for (let elem of arr) { ... }

Unless this is a joke about writing in Java & C++ (for which the colon syntax is valid) instead of javascript.