siraben

25 ms·

271.
by siraben 5y ago
In NixOS it's trivial to use and define NixOS modules, which handle restarting/starting/stopping systemd units. See the wiki example[0] on how to define and use a service that greets the user with GNU Hello. Also, since you h
272.
by siraben 5y ago
Of course, the chain rule explained via differential topology is simply functoriality! IME, category theory was much more valuable in differential topology in helping solidify why the structures and their compositional properties make sense
273.
by siraben 5y ago
There was a particular moment I remember from Milewski's monad video, where likened monad tutorials to a situation where you arrive on a remote island and the islanders ask you to explain what a function is. One's first instinct m
274.
by siraben 5y ago
That is the first definition stated in first-order logic, sure. But the operational reading of a (computable) function being something that takes in input and produces an output (via some algorithm) is still correct. It is possible to be bo
275.
by siraben 5y ago
Right, domain theory and denotational semantics let you talk about ⊥ in an order-theoretic setting, and I think it's also rich in connections between topology and lambda calculus. Though it might be the case that if functors already p
276.
by siraben 5y ago
As someone who studies both CS and pure math, it's quite interesting when I see posts that take a very operational reading of functors and monads, instead of its shorter and more precise categorical definition (as a mapping from one ca
277.
by siraben 5y ago
00:02:53 I don't think it was bad, there are were some frustrating moments such as having to put one's age as well as birth date, uploading an image, and reading the password requirements.
278.
by siraben 5y ago
Without a sweat, I recently changed from Ubuntu to NixOS on a server I have access to only via SSH (so mounting an ISO wasn't an option) using[0], so the switch happens live(!) and when you reboot you end up in NixOS. I've also do
279.
by siraben 5y ago
There's an issue for this[0]. Currently Nixpkgs relies on a 130 MB (!) uncompressed tarball, which is pretty big compared to Guix. It would be amazing to get it down to something like less than 1 KB with live-bootstrap. Also, due to th
280.
by siraben 5y ago
The funny part is that it's completely true, albeit not very useful if one doesn't know how monoid constructions work categorically (good explanation at [0]). Algebra: Chapter 0 has a similar overly technical definition for grou
281.
by siraben 5y ago
It was given axiomatically, with classical set theory as the foundation. Define the reals as a complete, ordered field. In fact it can also be proven that any two complete ordered fields are isomorphic. From this you can prove various canc
282.
by siraben 5y ago
We also used Stewart, and I think struggling (or excelling for that matter) at integral calculus is a poor indicator of one's competency in higher-level math, which is much more than memorizing 120 rewrite rules :)
283.
by siraben 5y ago
A lot of undergraduate math programs in the US start with unnecessarily hard calculus classes "weed-outs" which is unfortunate, since it discourages students who might have pursued mathematics otherwise. I can say from personal ex
284.
by siraben 5y ago
Nixpkgs contributor here. One of the misunderstandings by frenck is how Nix operates[0], which is not via mutable site-packages folders but more accurately as an immutable graph structure. What this means is that to have home-assistant pac
285.
by siraben 5y ago
Yes :), part of the joke is that even when you try to look for channels staying (and I've asked dozens of people at this point), they're obviously staying (tied to freenode), compromising (bridging) or very extreme (#techrights is
286.
by siraben 5y ago
At this point, it has been exceedingly clear that almost every project has jumped ship[0][1]. For weeks the leave list has grown to over 700 while the stay list is at 3. [0] https://github.com/siraben/freenode-exodus [
287.
by siraben 5y ago
Fixpoints are one of the most important concepts in denotational semantics and domain theory (see [0] for a good introduction). Denotational semantics lets you precisely specify the meaning of a program as a mathematical object, and also ni
288.
by siraben 5y ago
For math textbooks, one technique I've settled on is essentially summarizing main points and (importantly) drawing diagrams from the text. It's more work than just reading but I find the concepts stick very well especially for sub
289.
by siraben 5y ago
> But it's more accurate to model these systems as semilattices. That's the first time I've seen order theory used to describe hierarchical structures like a city. Continuing the analogy, what would the join of a nonempty
290.
by siraben 5y ago
This is amazing. I tried following Stephen Diehl's JIT compiler in LLVM tutorial[0] a few years ago but it was already outdated (the llvm-hs library changed quite a bit), and subsequent web searches didn't turn up much. For those
291.
by siraben 5y ago
Repo author here. I initially compiled this list as a gist because I saw several informal collections being shared in comments and over IRC, but did not cite their original sources and represented only a fraction of the move at large. Over
292.
by siraben 5y ago
Thank you, I will address this.
293.
by siraben 5y ago
> To me that's weird because calling the elevator is long running IO in a separate thread - might as well start it asap. Oh, man. I've felt exactly the same way wrt. a lot of IRL scenarios, implicitly optimizing the number of &
294.
by siraben 5y ago
> That's the part I have a problem with, mathematical objects are (more or less) exactly those that can be precisely and formally described. "Lambda calculus is a more elegant mathematical object" is not a statement I have
295.
by siraben 5y ago
> They can be formally and precisely described and I don't know of any mathematician who wouldn't accept TMs as a sound definition. Just because something can be formally and precisely described doesn't necessarily mean it
296.
by siraben 5y ago
That's still constructive. This can be a confusion because there's actually two kinds of contradiction proofs: to show ¬ P, assume P then derive a contradiction (false, ⊥) i.e., ¬ P := P -> ⊥. This is actually just fine
297.
by siraben 5y ago
> computer science is a branch of mathematics that deals with large but finite structures (so they need an algorithmic description) Another way to put this is that computer science deals with mostly constructive mathematics (more preci
298.
by siraben 5y ago
Are there accompanying slides or pictures of the blackboard for these lectures?
299.
by siraben 5y ago
Some of these still seem available via Google's cache[0] (both now deleted). [0] https://webcache.googleusercontent.com/search?q=cache:85ved4... [1] https://webcache.googleusercontent.com/search?q=cache
300.
by siraben 5y ago
The ease at which one connects to Libera with an IRC client, it was like nothing had happened, at this point (especially after recent events) you'd get a very close experience of what Freenode was like, with the same people, topics and

More ›