consilient

28 ms·

301.
by consilient 4y ago
> Also, curious where the extra energy comes from to keep the 'vacuum energy' (zero point energy?) from going down - IIRC, its remained constant even though the universe is expanding Energy is ill-defined in a global sense: it&
302.
by consilient 4y ago
> Haskell has a library where even the type system can express differentiation of general algebraic data types! It's not really the same sort of differentiation. Derivatives of algebraic data types (as implementable in Haskell) only
303.
by consilient 4y ago
Ron Maimon?
304.
by consilient 4y ago
`cata` with a cps'd argument
305.
by consilient 4y ago
You can do this with recursion schemes: Haskell: https://hackage.haskell.org/package/recursion-schemes Scala: https://github.com/precog/matryoshka
306.
by consilient 4y ago
`ST` isn't `State` (though the interface is very similar), it's a restricted variant of `IO`. An `STRef` is an actual mutable reference, backed by actual memory.
307.
by consilient 4y ago
> imperative code with some local mutability Haskell allows this, you just have to actually demonstrate that the mutation is local: statefulSum :: [Int] -> Int statefulSum xs = runST $ do n <- newSTRef 0 t
308.
by consilient 4y ago
> Side effects are inevitable so if you are going to have side effects in a monad, what's the point anyway, one way or another you have side effects. Imagine a style of programming where everything is assumed to be asynchronous, all
309.
by consilient 4y ago
Lazy structures can usually get the log(n) back when you amortize over many operations.
310.
by consilient 4y ago
> If constituent parts of bound states like atoms don't really exist as separate things, how come electrons in metals can move around readily? Is it that they're not really bound, or is it just that they 'attach' and
311.
by consilient 4y ago
In the absence of charges, Maxwell's equations reduce to `\nabla^2 F = d^2/dt^2 F`, (where F is the electromagnetic field tensor) which has solutions given by superpositions of traveling waves. What I suspect you want, however, is
312.
by consilient 4y ago
> Type-III Von Neumann algebras have no pure states All this means is that you're not going to recover the state of the entire universe from local observables. Disappointing, but hardly surprising.
313.
by consilient 4y ago
Sure, but at that level of generality you're also talking about the mechanism by which light propagates.
314.
by consilient 4y ago
The next useful falsehood on the ladder is that electrons in an atom exist as probability densities around the nucleus. Fire a photon here, and knock an electron off with this probability; fire it there, and get that probability instead. Bu
315.
by consilient 4y ago
The preferred basis is (roughly) the eigenbasis for the interaction term between the thermal environment responsible for decoherence and the decohering system in question, since those are the states that are robust to thermal noise. Outside
316.
by consilient 4y ago
Atoms aren't anything like that though. There are no little billiard balls, probability densities don't "bump", electrons don't actually orbit, and so on. Atoms just are what they are, and what they are does not adm
317.
by consilient 4y ago
The many-worlds interpretation is badly named: the "worlds" are just particularly classical-looking regions of the wavefunction we've chosen to draw some lines around for our own convenience. They're part of the map, not
318.
by consilient 4y ago
No, typescript has full type erasure and almost no type-directed emit. The shimming you're seeing is probably the result of tsc downleveling newer javascript features to older browsers: typescript itself has nothing to do with it. htt
319.
by consilient 4y ago
Haskell can do this, although it's pretty unidiomatic: data AlignedFunctionList a b where Identity :: AlignedFunctionList x x Pipe :: (x -> y) -> AlignedFunctionList y z -> AlignedFunctionList x z
320.
by consilient 4y ago
Yes, this is called refinement typing (which is a special case of dependent typing). Idris and Agda are probably the dependently typed languages that are closest to being usable for general purpose programming, but they've still got a