codebje

27 ms·

451.
by codebje 7y ago
That's a distributed systems problem, rather than an event sourcing one. I'm sure we've all done something like comment on a site like HN and not seen our comment appear when we reload. The more distributed the system, the mo
452.
by codebje 7y ago
When using FreeRTOS tasks, any use of printf() requires a substantially larger stack allocation per task. But I don't recall now any massive blow-out in binary size.
453.
by codebje 7y ago
There's a pretty vast difference between an N64 being less widely useful because it's hard to source an RCA display (hint: you can buy an RCA to HDMI adaptor cheaply) and N64s including a remote "kill switch" that one da
454.
by codebje 7y ago
MCTS is a random algorithm, and AlphaGo is no exception. The AI selects a move. What state is the board in now? It doesn't know, because the opponent also selected a move. MCTS models this with a probability distribution of the states,
455.
by codebje 7y ago
NAT is an acronym for "Network Address Translation" so that's the right term to use. NAT approaches to bridge IPv6 and IPv4 exist and work as well as IPv4-to-IPv4 NATs, that is to say pretty poorly: but we've long since
456.
by codebje 7y ago
> I don't know. The level of complexity this introduces seems to be way higher than anything in the original article. HTTP isn't synchronous, we just often pretend it is. You can pretend messages are synchronous using exactly t
457.
by codebje 7y ago
Much of software design is about composition, which is where category theory shines, just at the most shallow levels. If I dream up a way to tackle a problem, have I made a category? If I have two modules, can I compose them into one, is th
458.
by codebje 7y ago
You don't even need an email account to sign up, but I certainly understand a reflexive rejection of unnecessary sign-ups.
459.
by codebje 7y ago
Check out Lean Prover's online editor: https://leanprover.github.io/live/latest/ They borrow syntax from LaTeX math-mode to allow symbol entry, such that you can type "\ne" and as soon as you hit th
460.
by codebje 7y ago
GHC is fairly slow for a compiler, and Haskell has no separation of interface and implementation, so small changes can have big consequences. Template Haskell is the worst for it, but I did have a code generator produce code that took about
461.
by codebje 7y ago
Haskell's type system works best for me in allowing fearless changes, even significant ones to the core of a code base. The compiler won't let me overlook something. A comprehensive test suite would achieve the same thing, but I&#
462.
by codebje 7y ago
Whois++ largely failed. Custodians of resources weren't great at keeping their services operational. Hence Whois remains the primary access protocol today. RDAP has more legs to replace Whois than Whois++ did, but it solves a different
463.
by codebje 7y ago
You can't naively store 2^63 indices, else you'll get exponential run time to insert or lookup. Using a random access memory structure like a binary tree gives you logarithmic run time, but for a 64-bit index and 64-bit pointers w
464.
by codebje 7y ago
I found the article a bit obtuse, but I take it to mean we are drawing a uniform sample from a very large set. This means we don't need a shuffled sample, we just need one with a uniform chance of each source element being in the sampl
465.
by codebje 7y ago
The beautiful part of IoT is how there's billions of devices out in the wild with no upgrade plan. The ESP chips are OTA capable with example code provided, but that still means vendors have to incorporate the function, provide a way f
466.
by codebje 7y ago
Looks like it was a question about where to report it, followed by a handful of suggestions and _then_ the close. I don't see any reason for bad blood from that, especially since there was a bit of follow-on discussion and by the look
467.
by codebje 7y ago
L1 cache lines are typically 64 bytes long, and you're only reading 16 bytes of it per level of the tree. And a random pointer tree traversal is the worst case for CPU branch prediction, too. There are methods for optimising the use of
468.
by codebje 7y ago
A bare atmega328p-pu is 10x the price. LEDs are about 15x. Resistors and caps are, as another poster said, huge, but you're possibly getting factory seconds from an already mediocre brand. I buy decoupling ceramics and 5% resistors fro
469.
by codebje 7y ago
I pay Australian GST on AliExpress imports, but it doesn't make local outfits more viable. I buy hobby electronic components primarily, local suppliers are often one to two orders of magnitude more expensive, not just a few percent mor
470.
by codebje 7y ago
There is a much smaller set of useful 100Mb text files than there is of total possible ones. If there's only 15 million such useful 100Mb text files we should be able to map them to 15Mb executables.
471.
by codebje 7y ago
The events are a scheduling mechanism, not the work done. Performance probably relates more to the ratio of time spent selecting the next event to time spent executing code between yields than anything else: a thread waiting on an event joi
472.
by codebje 7y ago
Well, a reason to care about effects systems is to have a way to specify what a program is doing in a way that lets you calculate and manipulate properties of it (from proofs to optimisations), which generally means static typing and purity
473.
by codebje 7y ago
This is spectacular revisionism. Conditions arose out of MIT's AI labs, a place full of entrepreneurial enthusiasm and practical work, conditions were described in the early 80s. Algebraic effects come out of Endinborough, a place full
474.
by codebje 7y ago
All monadic computation can be accomplished with continuations, which offer a way to thread the monadic bind between sub-programs. But at some point this is equivalent to saying that all continuations can be implemented with machine languag
475.
by codebje 7y ago
A published code base doesn't necessarily mean a full revision history, just something others can reproducibly build and run. If your claims don't depend on specific behaviours of some body of code, you wouldn't need it - eg,
476.
by codebje 7y ago
My experience with ML notebooks in particular has been poor. But most of the publications I read are not in the field of ML, and I tend to prefer ones that use an abstract definition of an algorithm rather than code in any case - whatever t
477.
by codebje 7y ago
The irony here is that you appear to be unaware of the former work on algebraic effects, to the point that this one lightweight blog post forms your entire understanding of it and you mistake it for a limited and ill-defined language constr
478.
by codebje 7y ago
Common Lisp's condition system was first described in '83 for the Lisp Machine in a technical report that's hard to get one's hands on these days. It was described in an MIT AI Labs working paper a few years later by Pit
479.
by codebje 7y ago
That paper has another paper on algebraic effects in its list of references, so it's highly unlikely to be the origin :-)
480.
by codebje 7y ago
Jupyter notebooks are risky business for reproducible work. No dependency data means they're highly prone to bit rot. Stored results and out-of-order execution means they're prone to subtle errors. Environmental leakage is relativ

More ›