Maya :3

welp, twitter is finally imploding. here's my fedi: donotsta.re/mei

does anyone know a typesetting system that supports patches? one that remembers where it put all the line/page breaks and can redo specific modified pages in a way that is seamless with those around it?

@KakyoinToGej @serialismus nie jest legalne, jedynie zdekryminalizowane. tbh nie rozumiem czemu pierwsze skojarzenie każdego to zioło... government.nl/topics/drugs/t…

@thingskatedid the general recommendation I've heard is "take a look at the DIVA diagnostic manual and see how much it's calling you out" (if you find yourself unable to focus on the questions that's an automatic pass /hj)

god dammit

twitter do i have adhd?

@lethalbit b-but... what if there's null bytes on that floppy? 🥺

@rose_bohrer @__phantomderp Wouldn't that just mean sizeof(word_t) == 1?

@__phantomderp C++ certainly isn't ok, though a deranged part of me can sympathize that an implementation might desire to make all memory accesses word aligned and then make words the minimum size

> sizeof(bool) is not required to be 1 .... is C++ okay?

@arntzenius if you call your HOF with f as argument, make f an input to the incremental computation, have an intermediate query that asks for the value of f at a specific point, invalidate the input f every time you call your HOF. this does get ugly if you have reentrancy though

@meithecatte this is related to memoization but not the same, and I think Salsa-managed functions can only take first-order data as input, precisely because it gets used as an index in some sort of memo-table? I could be wrong here, I haven't actually used Rust Salsa, only a related system.

Anyone know of work on memoizing _higher-order_ functions? Normally, to memoize (f :: A -> B), A must support hashing/comparison so that we can shove it in a hashtable/search-tree. This prohibits memoizing eg (f :: (A -> B) -> C), since functions aren't hashable/comparable.

@arntzenius there is a certain isomorphism between the implementation strategies, though

@meithecatte I don't think this is what salsa does? AIUI Salsa is for incremental computation - run a program, change some inputs, & efficiently update the result by re-running only what depends on the change.

@arntzenius question is, whether you're memoizing because the HOF does expensive computations, or because you're applying it to expensive functions. but for the latter you'd just put the memoization on the first-order function, no?

@arntzenius okay, I might have brained myself in how close the thing is, because I'm not sure they actually use this with higher-order functions anywhere, but it's basically the same idea – record the queries your HOF makes of the passed-in function, run them in the same order and compare

@punsnparticles In Zathura, this is Ctrl+O.

@lethalbit perhaps this could tell you something about where it's stuck github.com/tokio-rs/conso…

Each major Game Boy hardware component's buggiest feature: PPU: The window APU: Channel 1 frequency sweep CPU: The STOP instruction OAM: Remaining idle without corrupting itself

@Myriachan on the Game Boy, the term of choice is "echo RAM"

What do you call regions of address space that act the same as another region due to how hardware decodes addresses? Like how 0800-0FFF on NES is the same as 0000-07FF. I’ve always called them “mirrors”, but I’m curious what other names they have.

@Yoski03 @CihanPostsThms Okay, but if you don't have a proof, there's absolutely no reason to call the value your program outputs "BB(47)".

There is a Turing machine with 47 states, 2 symbols and 1 tape that halts if and only if the Goldbach conjecture is false. Link: gist.github.com/jms137/cbb66fb…

@Yoski03 @CihanPostsThms There is no algorithm to simply compute the value of BB(47), by construction.

@Yoski03 @CihanPostsThms There is no deterministic process of finding the value of BB(47). You just analyze all the machines and try to prove they don't terminate or find a way to execute them faster than the naive algorithm. You can apply various techniques to discharge the easy cases, but still.