Huge spikes over a short period of time are hard to deal with for anyone, and payment processors have their own infra whose scalability Steam can't necessarily control.
Some LLM APIs let you give a schema or regex for the answer. I think it works because LLMs give a probability for every possible next token, and you can filter that list by what the schema/regex allows next.
The design of generics in this one seems rather well balanced in simplicity vs power.
The part about interface-typed values [1] is interesting. They do dynamic dispatch as a fallback when the function is too polymorphic to be be specialized.
In Rust terms it's as if it picks between `dyn` and `impl` automatically. It looks convenient, but also a bit of a non-obvious performance pitfall.
I agree in the sense that answering "what really are qualia" may be as impossible as answering "what really are quantum fields". At some point we may be forced to accept "it just is", but that doesn't mean we can't make meaningful progress first, just like in physics.
For instance, either new physics is involved or it isn't. Finding solid evidence for or against it does not seem impossible, and it would definitely constitute meaningful progress, at the very least by ruling some theories out.
> Even after mapping the entire visual cortex to all visual features, it just doesn't get us any closer to understanding that raw experience of "sight" that happens when you look at something. It's not the same thing.
Seems plausible that a detailed enough mapping of correlates one day uncovers a single thing/feature/location/architecure/pattern/whatever that is present only when qualia are, and absent in all other processes. That would at least point us in a concrete direction.
I agree. It's just quite a lot of verbose-looking XML. "I have to write that much XML" is probably not the first impression you want to give. I did scroll down and see that you don't actually have to write such XML by hand, but many will not.
To clarify, dependencies significantly affect incremental builds too. Seems loading information about compiled dependencies into the compiler and/or resolving stuff about them can take significant time.
Several languages have or have had this behaviour. C# made a similar change to its 'foreach' loops a long time ago (but not 'for' loops for some reason).
I suppose it's the natural way to do it when implementing a language and not thinking about it too much. It makes a for-loop equivalent to a simple while loop with the loop vvariable initialized outside of the loop.
https://neon.tech/docs/cloud/compatibility/ says "During technical preview Neon has restrictions on user ability to install PostgreSQL extensions. Following PostgreSQL extensions come pre-installed: [..]"