tel

7 ms·

31.
by tel 1y ago
Often it's easy to construct a family of sets representing something of interest. For example, we like to define integration initially as a finite process of breaking the integrand's domain into pieces, computing their area, and s
32.
by tel 1y ago
The quantification over T is still kind of weird, though. In a formulation like `for all T, (T and P consistent and T and neg P consistent)` is trivially false, just take `T = {neg P}` and now `{P, neg P}` is inconsistent. We're never
33.
by tel 1y ago
Yeah, I agree. "Independence" is fundamentally a property of the formal system you're working within (or really, it's a property of the system you're using and of the axiomatic system under test, the system a prop
34.
by tel 1y ago
Quantifying over T is probably not going to work. In informal terms that reads like "No logic exists where P is independent", which probably wasn't quite what you wanted, but also we can trivially disprove that with T = {}. A
35.
by tel 1y ago
Independent and undecidable aren't quite the same, even in formal logic. Or rather, sometimes they are but it’s worth being specific. A proposition P being independent of a theory T means that both (T and P) and (T and not P) are consi
36.
by tel 1y ago
I really like TAPL but would recommend Harper’s Practical Foundations of Programming Languages (PFPL) first (though skip the first 2 chapters I think?). https://www.cs.cmu.edu/~rwh/pfpl.html It’s far more directed than
37.
by tel 1y ago
Sorry, Haskell’s “monad transformer library”. One of the earliest approaches to composability of multiple monadic effects. It’s pretty similar to an algebraic effect system allowing you to write effectual computations with types like `(Erro
38.
by tel 1y ago
They're pretty similar, but with different ergonomics. Algebraic effects are similar to some kind of "free" monad technique, but built in. For being built in they have nicer syntax and better composability, often. You can ach
39.
by tel 1y ago
I would also always use that in a mathematical context but feel it’s weird to hear, say, “proved in a court of law”.
40.
by tel 2y ago
Looking around, here's a post by the author on Twitter where he shows similar motion and states that the time-lapse is 10m at 1min/sec. https://x.com/mag2art/status/1385940103189745669
41.
by tel 2y ago
I think that's right. At some level, any anticipation of a future state has to be measurable in some kind of confidence level. I suppose where I get lost is that, at least subjectively, I end up treating different anticipated return di
42.
by tel 2y ago
Yeah, that’s true. We invest in a lot of things, hoping for future value. But I guess I still treat those differently. I only hold enough USD for upcoming purchases. And I struggle to understand how investing in my marriage is speculative.
43.
by tel 2y ago
Reading a bit about it from the Flo paper - Describe a dataflow graph just like Timely - Comes from a more "semantic dataflow" kind of heritage (frp, composition, flow-of-flows, algebraic operators, proof-oriented) as opposed to t
44.
by tel 2y ago
It’s been a minute since I used my mlua integration. I recall more packaging difficulty, investigating LuaJIT and Luau for a while. I had to make more decisions around my API, whether it was OO or a package, what libraries to allow. When in
45.
by tel 2y ago
I’m already writing a Rust system. I’ve tried integrating with mlua. It works, but Rhai is simpler to embed. Simpler to build. (I also tried Piccolo which is very cool but also not simple.) Rhai also doesn’t include a lot of complexity that
46.
by tel 2y ago
A function from a fixed input is a monad (called the “Reader” monad). If you constrain all IO to happen underneath that function then it will be deferred until you evaluate the result. In those senses, these are the same. You can emulate th
47.
by tel 2y ago
Generally, when we construct models we do so by defining what probability they give to the data. That's a function that takes in your data set and returns some number, the higher the better. Technically, these functions need to satisfy
48.
by tel 2y ago
Just my lack of experience here, but I'm trying to verify I'm successfully using sold. The mold linker claims it leaves metadata in the .comment section, but on mach-o does that exist? Is there a similar evaluation command using o
49.
by tel 2y ago
So you're looking for a way for a future to make use of temporary access to state just while being polled? The issue being that since a future captures references in self you can't have multiple futures able to reference the same
50.
by tel 2y ago
What is a first-class resume argument? How does it enable &mut State and non-sequential messaging within Rust's current futures design?
51.
by tel 2y ago
It's clear that there's some beginning of this in place. They reference it as initial in the docs there and it's missing quite a bit. I'm not a huge fan of what I'm seeing here where each actor is implicitly itself
52.
by tel 2y ago
I'm always most curious with these frameworks how they're considering supervision. That's the real superpower of OTP, especially over Rust. To me, Rust has adequate concurrency tooling to make ad hoc actor designs roughly on
53.
by tel 2y ago
Generally these parameters are unknown and the drift parameter is often quite a bit smaller than the volatility. As a consequence, you cannot be sure your investment is secure and its value is likely to wobble significantly in the short ter
54.
by tel 2y ago
I tried to replicate this and Claude 3.5 Sonnet got it correct on the first try. It generated a second set of dates which contained no solution so I asked it to write another python program that generates valid date sets. Here's the co
55.
by tel 2y ago
As an amateur, I think I follow most of this, at least at some level, but I don't follow why you'd unify the basis elements and particles. Thinking of a quantum harmonic oscillator, the eigenstates have some kind of localization t
56.
by tel 2y ago
Unfortunately, no. Or, rather, I'm sure there's a way to make it happen although that's not typical practice. Typically you'd resort to mapping the left sides of your eithers so that the error types match. Rust offers a
57.
by tel 2y ago
In Haskell, that's usually that's done using `do` syntax. do a <- somePartialResult b <- partialFunction1 a c <- partialFunction2 a b return c where we assume signatures like somePar
58.
by tel 2y ago
Personally, I think it’s possible to not encounter them. I surely avoided them for a while in my own career, finding them to be the tricks of a low-level optimization expert of which I felt little draw. But then I started investigating type
59.
by tel 2y ago
Without judgement, this feels like a switch up. It seems to me that the prior author did not suggest they were necessary, but instead ambient, available, and interesting. Indeed for many they are not useful. At the same time, that might be
60.
by tel 2y ago
Not being familiar, what is different about Buc-ee's? Why do people spend 30-60 minutes inside?

More ›