I love Bun & Zig and this feels a bit like my parent are getting a divorce. I thought it was a bit strange that Bun did not sponsor the Zig foundation while others much smaller companies have.
Man am I getting tired of these articles and we can do without this neurotic melancholic whining. Maybe it is the title of the article that triggered me, but it reminded me of hearing Douglas Murray read excerpts from "The Strange Death of Europe" in his self-aggrandising pompous tone.
The authors colleague needed a couple of tries to write a kernel extension and somehow this means something about programming. If it was not for LLMs I would not have gone back to low-level programming, this stuff is actually getting fun again. Lets check the assembly the compiler produced for the code the LLM produced.
Interesting, I did not know that colors-of-noice was related to this, what you say sounds conceptually very similar to how Maxwell's demon connects thermodynamics to information theory.
No, it is a hypothesis I formulated here after reading the article. I did a quick check on google scholar but I didn't hit any result. The more interesting question is, if true, what can you do with this information. Maybe it can be a way to evaluate a complete program or specific heap allocator, as in "how fast does this program reach universality". Maybe this is something very obvious and has been done before, dunno, heap algos are not my area of expertise.
TS returns a tree with nodes, you walk the nodes with a visitor pattern.
I've experimented with using tree-sitter queries for this, but for now not found this to be easier.
Every syntax will have its own CST but it can target a general AST if you will. At the end they can both be represented as s-expressions and but you need rules to go from one flavour of syntax tree to the other.
AST is just CST minus range info and simplified/generalised lexical info (in most cases).
You have to figure this out for yourself in most cases.
Tree sitter does have a query language based on s-expressions, but it is more for questions like "give me all the nodes that are literals", and then you can, for example, render those with in single draw call. Tree sitter has incremental parsing, and queries can be fixed at a certain byte range.
This is like the difference between an orange and fruit juice. You can squeeze an orange to extract its juices, but that is not the only thing you can do with it, nor is it the only way to make fruit juice.
I use tree-sitter for developing a custom programming language, you still need an extra step to get from CST to AST, but the overall DevEx is much quicker that hand-rolling the parser.
Ah, I think I found the reason as to why WebAssembly (in a browser or some other sandboxed environment) is not a suitable substrate for near native performance. It is a very ironic reason: you can't implement a JIT compiler that targets WebAssembly in a sandbox running in WebAssembly. Sounds like an incredibly contrived thing to do but once speed is the goal then a copy-and-patch compiler is a valid strategy for implementing a interpreter or a modern graphics pipeline.
Polders have personhood in some jurisdictions.
The government reclaimed the land from the sea,
sold it to multiple people, levies taxes on them and now the dykes need to be maintained.
This is just legal fiction, technology developed and applied cross industry.
The mere concept of water rights implies obligations must lie someplace.
All this talk about reified gods takes away much of how mundane the concept is.
After coming down from the shock of learning there are people like you I was even more amazed that one of the founding engineers of Pixar, and a giant in computer graphics, also has this condition. He even did a survey that found his artists where more likely to be on the aphantasia spectrum than managers. Dunno, maybe some people are so driven to create what they cannot think or see.
Structured State Space Models and Mamba. Models like Mamba [Gu and Dao, 2023] can be in-
terpreted within GWO as employing a sophisticated Path, Shape, and Weight. The Path is defined by
a structured state-space recurrence, enabling it to model long-range dependencies efficiently. The Shape is
causal (1D), processing information sequentially. Critically, the Weight function is highly dynamic and input-
dependent, realized through selective state parameters that allow the model to focus on or forget information
based on the context, creating an effective content-aware bottleneck for sequences.
> The irony, of course, is that if you've read this far, it may mean you’ve already mastered a rare skill: sustained attention in a world of distraction.
No, sorry I read the first and last sentence. This is why I like the short format more then the long forms, it often boils down to the same clever narrative trickery without waisting 3 hours of your life.