tel

29 ms·

241.
by tel 6y ago
How is your set union example not another intersection (your quantification could go in one of two places though, they = (set of readers) cap (set of writers) versus they = { p in people such that (p writes) cap (p reads) }.
242.
by tel 6y ago
Here "horseback" is a term I'm using to mean "applied in the field, cutting corners as needed to make things valuable now". I'm not sure exactly where I picked it up, but I like the idea.
243.
by tel 6y ago
Even those are very heavyweight to my mind. I’m thinking things as simple as applying semantics to flow charts and making state tables. Exhaustive enumeration of small spaces forms a neat on-ramp to more powerful methods, if we choose to
244.
by tel 6y ago
These systems are in one sense ideal for formal methods: they're complex interactions between systems, often coordinating over resources and time, with many easily identified constraints that must be maintained. On the other hand, they
245.
by tel 6y ago
It's always a disappointing state of affairs when people skip simple models. If nothing else, a nice baseline like the one described in this article should be constructed before using ML techniques to serve as a comparison point.
246.
by tel 6y ago
Parameterized types can help here a lot. I didn't want to speak to them too quickly so I blurred a few lines, but it's a good point. Parametric types help with part (a) by allowing you to specify only part of the structure of your
247.
by tel 6y ago
It's absolutely a different approach to generics. Or, rather, that's the ringer. I want to say first: OCaml's take on modules is just a really nice way of doing namespacing as well. Secondly, generics depend upon (a) having a
248.
by tel 6y ago
I don't think it's dynamic, just macros. a |> foo() |> def do ... end just gets macroexpanded to foo(a) |> def do ... end and then def foo(a) do ... end.
249.
by tel 6y ago
Agree and disagree. As often is the case, once you make an abstract concept concrete in the codebase it gets distorted and exploited. "Keyword interfaces" as you helpfully define here are a prime example. They are not 1-to-1 with
250.
by tel 6y ago
Most discussion and arbitration about testing comes down to the anemic way programmers talk about interfaces. We say all the right stuff, but then skimp on the details. "Program to the interface, not the implementation!" Oh, but,
251.
by tel 6y ago
Monopolies are a well-defined theoretical concept, but in practice it's about market power. When one entity has overwhelming market power it's afforded with options that harm consumer welfare. Anti-trust isn't about defeating
252.
by tel 6y ago
Frankly good type systems displaced TDD for me. They do a better job getting at the goals of TDD than TDD does. Types in good systems (OCaml, Rust, Typescript, Scala, Haskell, others) are 100% laser focused on depicting good public interfac
253.
by tel 6y ago
The thing that feels implicit, yet false, in all of this is that workflows are static. People evolve, learn, change. Teams even more so. The most important process I implement with teams is retrospection and its use as a mechanism to modify
254.
by tel 6y ago
A lot of category theory is just about composition, how different structures compose and how compositions of those structures continue to be composable. So in this case, GLA builds the theory of linear transformations from trivial/simp
255.
by tel 6y ago
Depends on what you mean by relevant information. GLA exposes the many compositional natures of linear transformations. The fact that there is a compact matrix representation is a wonderful treat.
256.
by tel 6y ago
It's not non-determinism, it's partial information. The NN part guesses the best move that will be found by search X% of the time. If you just ditched the search part, Leela would be faster and lose out on (1-X)% of the better mov
257.
by tel 6y ago
No, those are different things. The proposition and its proof. You can assume a proposition and make use of it without a proof. A proof furnishes the evidence that a given proposition is attainable (e.g., true). Truly, you could even see th
258.
by tel 6y ago
That's basically what Silvercar does
259.
by tel 6y ago
In addition to other answers, I think it's important to note that Nix is comparatively very small (but growing!). To that end, the Nixpkgs policies are still in flux and defined somewhat culturally (at least compared to older, larger d
260.
by tel 6y ago
It's kind of a mess. Nix is a collection of tools and systems that together form a highly reproducible build system. Nix is also a declarative, largely pure and lazy programming language that you use to design and specify the different
261.
by tel 6y ago
Oh dang! Yes, hey! Nice to hear from you—I'll send you an email :)
262.
by tel 6y ago
How does one get started? I feel like I have a lot of the math background, but approaching putting this toward an actual market feels opaque.
263.
by tel 6y ago
Learning is just like any other project. Admit that it's tough and that you need a plan. Build process to accomplish that. Aim for consistency over accomplishment. Bird by bird. One issue with learning things is that as you learn, you
264.
by tel 6y ago
The next step to investigate here is line search.
265.
by tel 6y ago
Existential quantification implies search because, computationally, we want to actually deliver at least one example of the existence. For instance, the classic puzzle where people sit next to one another at dinner, wearing colored outfits,
266.
by tel 6y ago
I think, loosely, an existential quantifier is "trivial" if you can immediately discharge it. I don't know that there's a very formal approach to this, but there's definitely a way to dream up completely trivial exi
267.
What Declarative Languages Are (2013)(semantic-domain.blogspot.com)
36 points by tel 6y ago|12 comments
268.
by tel 6y ago
This is accounted for in more professional methods which estimate error. During a period of exponential growth, the error 6 weeks out is very sensitive to tiny errors occurring in immediate measurement. It's not so much that fitting ex
269.
by tel 7y ago
I mean the tracing operation that produces a structure appropriate for AD computation. I agree with you that there's work needed to specify the node derivatives. Although, honestly, I misspoke. The difference between AD and symbolic di
270.
by tel 7y ago
Honestly, I don't disagree, but I feel like it's harder to get resources if you're not aiming for neural networks somewhat directly.

More ›