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... https://t.co/Ibi6CPYAnp
@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)
@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
@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
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
@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.