Viewing profile — moonchild

> Later version allowed to scan from arbitrary position by mirroring first bucket as last you may find my improved table design of interest, which avoids the need for mirroring: ht…

suppose the data were generated by a csprng with 256 bits of state. then in fact there are just slightly more than 256 bits of entropy there (prng state plus the length of the gene…

> "the" instance i suppose you can probably do anything with dependent types, but i'm not sure this is a useful perspective. i commend you to read my comments on the red website ht…

they are talking about treating ocr as lossy. i wonder about making a lossless compression algorithm for text scans based on an ocr; in effect, use the ocr to predict which text wi…

> they should be integers i am not cheating; you are cheating by trying to do integer arithmetic instead of float arithmetic. in particular: 99 * progress is a (potentially big) in…

depends how you define causality. if you consider the execution of one operation to cause the execution of the next operation in program order, then causality was already broken by…

> I've never heard anything about these sorts of graph algorithms being possible with good asymptotics in an array style yeah—idk graph algos really, but have heard parallelising c…

what exactly do you mean by 'global parse'? it's very usual, i think, when operating on data stored in files, to parse them into in-memory structures before operating on them? but …

lengyel told me he has implemented some sort of hinting on the gpu for slug (i suspect it's not programmable, but didn't ask)

programmable hinting was already a thing. it's just switching to wasm from a bespoke language

> 1/t^p i don't think that's right. it's just 1/t. after all, after t time, one task must have made progress; since there are t tasks, the probability that i'm the task that made p…

i saw this last week and was incredibly confused. aside from being naive it's totally overfit where general approaches are very well known??

> float hm ... >>> def percent(progress, total): ... return round(99 * progress / total + 0.5) ... >>> x = 9007199254740990.0 >>> x - 1 >> percent(x - 1, x) 100

> alignment granule if you have metadata to identify object starts then you can do 1 bit per min object size (which can be bigger than the alignment granule)

even single-output is a dag; you can explode the dag into a tree, but then you pay in time. suppose some expensive term x is used to compute n other terms. after computing x, assum…

greenspun's tenth rule: > Any sufficiently complicated C or Fortran program contains an ad hoc, informally-specified, bug-ridden, slow implementation of half of Common Lisp.

i would do a variable-size header 4 or 8 bytes for most small objects (8 if you want to provide alignment, 4 if not or if you can squish your pointers). one bit identifies if the h…

(dynamic) computation forms a dag, not a tree. i think a sum scan (n inputs -> n outputs) will trigger the worst case. it might be that computations tend to be tree-shaped, so you …

feel free to ping on irc if interested in chatting more on the topic, though i'm not sure i have a ton more original thoughts atm if you have an expression with n terms, then you w…

so a middle ground (as many pseudo-symbolic approaches). glanced at wikipedia—this seems not dissimilar conceptually to the abstract domain of polyhedra, in that it's symbolic but …

you may find this interesting if you haven't seen it already: https://fredrikj.net/blog/2017/11/new-rigorous-numerical-int...