I find the #2 issue happens more easily with a higher simulation speed too.

It's Verlet integration: https://en.wikipedia.org/wiki/Verlet_integration

Reminds me of TempleOS, where all programs run in the same address space. Is this the same concept here?

Ironically, there are so many pointers at this point that OSes often now do use a single address space for every program (with escape hatches in case you need aliasing).

Virtual memory and vtables are now more about access control than about managing the scarcity of pointers.

Can you provide any citations for this (extraordinary, if true) claim? My knowledge of operating systems (which is based on experience in designing toy ones, but also studying other operating systems) suggests this is not the case on at least windows, macOS and linux. Feel free to correct me if I am wrong however!

I wonder if it could run on this Rust implementation of the CLR I wrote a few years ago: https://github.com/Leowbattle/clr_lite

That looks like a really interesting experiment! Did you ever do write up of your work? I’m curious how far you got.

It is her. Read the second paragraph of "Personal Life" https://en.wikipedia.org/wiki/Grimes

I met some of the people from this company at Nordic Game Jam 2023 - lovely people

Do you mean if the utensils have been used to prepare meat since last being washed, or if the utensils were ever used to prepare meat?

I don't know much about Mathematica but doesn't Dynamic work a bit like that?

One example of a programmer who was very mentally ill is Terry Davis, known for creating TempleOS.

If modern high performance code relies on making the microcode do "the right thing", and making sure the right data is in cache then why don't CPU manufacturers allow control over such things?

What’s right for today’s CPU is horrible for next year’s in those terms - and also the other way around.