Ciro Santilli @cirosantilli 35

Less evil are BLOBs that come from Reproducible builds.

NCBI online tool to find and view all open reading frames in a given FASTA: www.ncbi.nlm.nih.gov/orffinder/

Ciro Santilli has already watched all the best films in history, and as a result any of those new movies that is full of clichés and has no innovative aspect at all (99.99999% of all modern movies) makes Ciro want to puke and to start Googling TV Tropes to classify as many clichés as possible.

Good movies are those that teach you mechanisms of the real world. Willing suspension of disbelief must be maintained at all costs.

Or of what could happen a world where a single sci-fi element is added and explored to its limits.

Love is not an interesting aspect of the world. You solve your love life at university, Tinder or Tango.

The actually interesting aspects of the world are:

Movies with a lot of action scenes, with exception of some war movies, are shit.

The Sliding scale of idealism vs. cynicism must be close to Cynicism max at all times. Movies with pure good and pure bad are shit.

Knowing spoilers has no effect in the film's enjoyment. The interest of storyline concepts is all that matters, visuals and acting are useless.

In a multi-language film, when two foreign characters speak English to each other when they obviously would have spoken their native language, that is a crime. Original language + subtitles is a must!

On Ubuntu 22.10:just works with GNU go.

The Busy beaver scale allows us to gauge the difficulty of proving certain (yet unproven!) mathematical conjectures!

To to this, people have reduced certain mathematical problems to deciding the halting problem of a specific Turing machine.

A good example is perhaps the Goldbach's conjecture. We just make a Turing machine that successively checks for each even number of it is a sum of two primes by naively looping down and trying every possible pair. Let the machine halt if the check fails. So this machine halts iff the Goldbach's conjecture is false! See also Conjecture reduction to a halting problem.

Therefore, if we were able to compute $BB(n)$, we would be able to prove those conjectures automatically, by letting the machine run up to $BB(n)$, and if it hadn't halted by then, we would know that it would never halt.

Of course, in practice, $BB$ is generally uncomputable, so we will never know it. And furthermore, even if it were computable, it would take a lot longer than the age of the universe to compute any of it, so it would be useless.

However, philosophically speaking at least, the number of states of the equivalent Turing machine gives us a philosophical idea of the complexity of the problem.

The busy beaver scale is likely mostly useless, since we are able to prove that many non-trivial Turing machines do halt, often by reducing problems to simpler known cases. But still, it is cute.

But maybe, just maybe, reduction to Turing machine form could be useful. E.g. The Busy Beaver Challenge and other attempts to solve BB(5) have come up with large number of automated (usually parametrized up to a certain threshold) Turing machine decider programs that automatically determine if certain (often large numbers of) Turing machines run forever.

So it it not impossible that after some reduction to a standard Turing machine form, some conjecture just gets automatically brute-forced by one of the deciders, this is a path to

Their websites a bit shitty, clearly a non cohesive amalgamation of several different groups.

E.g. you have to create several separate accounts, and different regions have completely different accounts and websites.

The Europe replacement part website for example is clearly made by a third party called flex.com/ and has Flex written all over it, and the header of the home page has a slightly broken but very obviously broken CSS. And you can't create an account without a VAT number... and they confirmed by email that they don't sell to non-corporate entities without a VAT number. What a bullshit!

Amazing tool that captures packets and disassembles them. Allows you to click an interactive tree that represents Ethernet, TCP/IP and application layer like HTTP.

Start capture immediately from CLI, capture packets to/from 192.168.1.102:

Quick overview at stackoverflow.com/questions/1780599/what-is-the-meaning-of-posix/31865755#31865755

Exmples under c/posix: