Related to aviation systems, here's a writeup about a complicated incident, where a discrepancy between two "identical" components was a contributing factor:
It was possible for one channel to detect that the plane was airborne while the other channel did not [...] With one channel in flight mode and the other in ground mode, the SECs believe that there has been a failure of one of the LGCIUs, and they both shut off.
mary chung's mentioned! i miss mary chung's
When people compile compilers do they actually specialize a compiler to itself (as in definition 3 in the paper) as one of the steps? That's super interesting if so, I had no idea. My only knowledge of bootstrapping compilers is simple sequences of compilers that work on increasing fragments of the language, culminating with the final optimizing compiler being able to compile itself (just once).
I did yes :)
My university sends me checks occasionally, like when they overcharged the premium on my dental insurance. No idea why they can't just do an electronic transfer like for my stipend.
and here i just assumed the name was original to ffxiv
The article is very poorly written, but here's an explanation of what they're saying. An "inductive Turing machine" is a Turing machine which is allowed to run forever, but for each cell of the output tape there eventually comes a time after which it never modifies that cell again. We consider the machine's output to be the sequence of eventual limiting values of the cells. Such a machine is strictly more powerful than Turing machines in that it can compute more functions than just recursive ones. In fact it's an easy exercise to show that a function is computable by such a machine iff it is "limit computable", meaning it is the pointwise limit of a sequence of recursive functions. Limit computable functions have been well studied in mainstream computer science, whereas "inductive Turing machines" seem to mostly be used by people who want to have weird pointless arguments about the Church-Turing thesis.
Karl Radek jumpscare