jaen

8 ms·

91.
by jaen 7mo ago
That does require designing the language grammar in a certain way, in particular, there should not be any optional elements in any productions used by statements on the right-hand side (otherwise it's ambiguous whether to terminate t
92.
by jaen 7mo ago
Actually no, there's no "ROM", that's just the name for the code that gets loaded into RAM. Even the article talked about self-modifying code... It's a Von Neumann machine with no instruction cache coherence instruc
93.
by jaen 7mo ago
TypeScript has row polymorphism at home.
94.
by jaen 7mo ago
Grandparent is an LLM/agent, so what can you expect... sigh.
95.
by jaen 7mo ago
People building these Rube Goldberg contraptions: Do you actually run evaluations if this is any better at all than eg. giving it access to a Python REPL, or just toughing it out with random tools composed via shell scripts? Why would an
96.
by jaen 7mo ago
What's the physics solver used here? This demonstration quickly runs into common problems associated with overly simplistic solvers/integrators where everything starts to become unstable and "vibrate" / "twitch
97.
by jaen 7mo ago
That's just making things harder to write by disabling useful features. Always using `select`s can actually be MORE inefficient than using predictable branches, as for a select both sides of the conditional must be evaluated, while
98.
by jaen 7mo ago
The page literally says it's not written in C, instead a memory-managed compiled dialect of PHP called Zephir...
99.
by jaen 7mo ago
Cool, although more ILP (instruction-level parallelism) might not necessarily be better on a modern GPU, which doesn't have much ILP, if any (instead it uses those resources to execute several threads in parallel). That might explain w
100.
by jaen 7mo ago
For similar languages / compilers in this area: 1. ISPC [1], the Intel® Implicit SPMD Program Compiler also compiles SIMD programs with branches and other control flow efficiently using predication/masking etc. 2. Futhark [2] comp
101.
by jaen 7mo ago
The article already addresses that... It's not easy and the major compositors (Gnome, KDE) are NOT wlroots based, making this point mostly moot anyway. This protocol at least has a chance of using a custom WM with an advanced composi
102.
by jaen 7mo ago
Personally, I find the "fade-in" animations quite distracting, since I read/think faster than the animations reveal information, so it constantly "interrupts"/"stutters" my thought process. Animations
103.
by jaen 7mo ago
Yes, "just", mind the context. Are you trying to imply that learning/using an advanced programming language is somehow more complicated than infinite XML slop engineering, which as I said ideally requires knowledge of the s
104.
by jaen 7mo ago
Syntactic complexity of natural language is basically solved by LLMs (ie. given an unambiguous natural language statement, it can be translated to any formal language syntax with 99% success), so just wrapping mathematical operators a
105.
by jaen 7mo ago
Or... you could just use a programming language that looks good and has great support for embedded domain-specific languages (eDSL), like Haskell, OCaml or Scala. Or, y'know, use the language you have (JavaScript) properly, eg. add a `
106.
by jaen 7mo ago
I really wish people would read the article, the library does exactly this: > Okmain downsamples the image by a power of two until the total number of pixels is below 250,000.
107.
by jaen 7mo ago
I've had success in the past in customizing macOS key bindings using Karabiner: https://karabiner-elements.pqrs.org/
108.
by jaen 7mo ago
The page literally credits "Open English Wordnet" (based on it) in the sidebar :) (the link is broken though, it should be https://github.com/globalwordnet/english-wordnet )
109.
by jaen 7mo ago
Single testcase benchmark, no citations, inventing nonsense terms for trivial concepts like "Synaptic Plasticity", LLM-slop style writing. Nobody in their right mind would publish this to ArXiv. I suggest looking up and reading gu
110.
by jaen 7mo ago
"Dependency injection is just effects" but conversely, also "Effects are just dependency injection of continuations"
111.
by jaen 7mo ago
Might've fact-checked this article after letting Claude write it... Erlang processes are in no way what's commonly called "persistent" - there's no way to persist them automatically (ie. freeze to disk and wake late
112.
by jaen 7mo ago
Unfortunately looks awful when your DPI is not an integer ratio (white gaps everywhere). Common problem in "pixel" UIs on the web, anything that wants pixel fidelity needs to use `window.devicePixelRatio` to scale everything to
113.
by jaen 7mo ago
At least for the main accomplishment, the Tietze extension theorem, the natural language statement and the Megalodon theorem looked quite easy to correspond, and the dependency chain seemed fairly easy as well. (the fact that the proof is 1
114.
by jaen 7mo ago
Technically interesting post, but the LLM writing style is really grating these days, couldn't bear to finish reading it...
115.
by jaen 7mo ago
how's this different from the many existing tmux/terminal MCP servers?
116.
by jaen 7mo ago
The problem was mostly Java, not the idea. Java enforced a rigid (static) disjoint exception hierarchy (necessitating the boilerplate wrapping), no error inference, inability to parametrize over thrown exceptions etc. etc. Basically fired a
117.
by jaen 7mo ago
re: business class, > Perhaps oddly, this is superior to first class, where seats are arranged in a 2-2 layout; second class carriages have a tighter 2-3 configuration. I guess the writer of the article does not really ride trains, the t
118.
by jaen 7mo ago
For convenience, a link to the original paper ("AutoCodeBench: Large Language Models are Automatic Code Benchmark Generators"): https://autocodebench.github.io/#:~:text=Experimental%20Resu... Go as a language for
119.
by jaen 7mo ago
The dimensions seems very "profession"-oriented (as a contrast to other personality inventories that can also be used in professional psychology). Questions: 1. Where did the 12 dimensions come from? 2. Are they ~independent (ie.
120.
by jaen 7mo ago
They might be able to solve those faster though (than silicon), since nobody has demonstrated a workable general-purpose (conventional) photonic computer - but TfA at least says they have a machine with 256 "spins", so while t

More ›