I just found this setting in mobile, but I don't know if it's the same feature: Settings > Data Collection > Marketing

I don't think so. I already had the setting visible in the UI disabled, but the thing in about:config was still on.

I'm interested in attending these in my area (SF South Bay). How should we discover similar meetups?

Is there a place we should subscribe to?

This reminds me of the difference between micro-benchmarks vs real programs. I would always include extracts from real texts of a few different types (novels, lists, technical writing, short paragraphs like in a playscript). But a test text like these are also helpful in exercising a few rare cases, like z, q, and certain ligatures.

Thanks for the actual paper they published

I'm not OP, but I had no idea KDE had that built in. I'll have to check for something analogous in my xfce config when I'm back at my laptop. Thanks!

It takes hardware support.

> [...] other algorithms may require the sort of induction one gets with constructive proofs to sufficiently verify. There is an art to this which will lead to style changes in C and a slightly different way of building up functions from pieces that can be trivially model checked.

Is there a book or article that talks more about this? I.e. how to write code in a way that is more amenable to model-checking (bounded or otherwise)?

Unfortunately, I have not found any good tutorials. If it helps, I plan on writing one very soon.

where can we follow you to hear more about this?

What's the common tool people use these days for manipulating json in an awk-like manner?

gron (https://github.com/tomnomnom/gron) to transform it and query and then invert the transformation?

Probably: https://jqlang.github.io/jq/

I would say that lots of people use jq. But it’s not really awk-like.

You could probably use gron with awk pretty easily, since gron stands for “greppable json”.

But I also wonder how an awk with native json support would look like.

Food for thought: have a look at this paper[0] about structural regular expressions. The author (Rob Pike) sketches in the last section an awk-support. I remember using such regexps a while ago to tweak indented JSON and JSON-like data (the indentation allowed to loop on hashes easily).

An awk with json support would for the most part need to be able to loop on hashes and arrays, and provide ways to travel in-depth. So far regular awk can travel through arrays (line-separator), and "in-depth" (e.g. nested "arrays") via regular loops & cie. Probably easier to think about it with a few concrete examples though.

[0]: http://doc.cat-v.org/bell_labs/structural_regexps/se.pdf

Even the CDs these days will often refuse to play without an internet connection.

Umm, the topic is game CDs, not music.

It might vary from state to state. Here in California it's pretty inconsistent. Anecdotally, in Virginia it was almost always there for every product.

I'm in California and it seems consistent across the large grocery store chains to me.

For one, it's really close to the upper end of how massive a neutron star can be. https://en.wikipedia.org/wiki/Tolman%E2%80%93Oppenheimer%E2%... says the limit is around 2.01 to 2.17 solar masses.

The next problem is https://arxiv.org/pdf/1006.2834.pdf which has the lightest black holes at 5.0⊙

There's another interesting object - https://www.science.org/doi/10.1126/science.adg3005

This is a binary system with a total mass of 3.887⊙ ± 0.004 ... which puts the companion in the system at 2.09⊙ to 2.71⊙ ... which may be in the "heavier than any theoretical neutron star, but lighter than any known black hole.

A recent Dr. Becky video on this: FOUND in the MASS GAP: The heaviest neutron star OR the lightest black hole? https://youtu.be/8PHt7NcwllA