← Înapoi la Urmăritori

Cel mai recent articol

Ultima verificare

Urmăritori 0 urmăritori
Articole: 25
  1. Some type constructors are tensor products

    Introduction I want to return to something I've mentioned a couple of times in the past - the fact that applying certain type constructors performs a tensor product.

  2. A Simple Switch Makes Code Differentiable

    Introduction One game I like to play is decomposing code and algorithms as compositions of simpler pieces even when they already seem as simple as they could be.

  3. "What does it take to be a hero?" revisited

    Biased posteriors the hard way I was previously interested to see how die rolls in an RPG appear when conditioned on you having survived an unlikely situation.

  4. 1 We only hear about the survivors In the classic Star Trek episode Errand of Mercy, Spock computes the chance of success: CAPTAIN JAMES T.

  5. A more stable version of this article can be found on github.

  6. What does it mean for a monad to be strong?

    This is something I put on github years ago but I probably should have put it here.

  7. Google have stopped supporting the Chart API so all of the mathematics notation below is missing.

  8. Some pointers to things not in this blog

    Some pointers to things not in this blog One reason I haven't blogged much recently is that my tolerance for blogger.com has reached its limit and I've been too lazy to build my own platform supporting mathematics and code.

  9. Why is nuclear fusion so hard?

    Why does water fall out of an inverted cup?

  10. Running from the past

    Important Note Google have stopped supporting the Chart API so all of the mathematics notation below is missing.

  11. A tail we don't need to wag

    Introduction I've been reading a little about concentration inequalities recently.

  12. What is a photon?

    Introduction Popular science writing about quantum mechanics leaves many people full of questions about the status of photons.

  13. Introduction TL;DR The behaviour of a certain kind of delay component has a formal similarity to Löb's theorem which gives a way to embed part of provability logic into electronic circuits.

  14. A relaxation technique

    Introduction Sometimes you want to differentiate the expected value of something.

  15. Logarithms and exponentials of functions

    Introduction A popular question in mathematics is this: given a function \(f\), what is its "square root" \(g\) in the sense that \(g(g(x)) = f(x)\).

  16. Building free arrows from components

    Introduction Gabriel Gonzalez has written quite a bit about the practical applications of free monads.

  17. Addressing Pieces of State with Profunctors

    Attempted segue Since I first wrote about profunctors there has been quite a bit of activity in the area so I think it's about time I revisited them.

  18. Introduction Google have stopped supporting the Chart API so all of the mathematics notation below is missing.

  19. Dimensionful Matrices

    Introduction Programming languages and libraries for numerical work tend not to place a lot of emphasis on the types of their data.

  20. Cofree meets Free

    > {-# LANGUAGE RankNTypes, MultiParamTypeClasses, TypeOperators #-} Introduction After I spoke at BayHac 2014 about free monads I was asked about cofree comonads.

  21. Types, and two approaches to problem solving

    Introduction There are two broad approaches to problem solving that I see frequently in mathematics and computing.

  22. The Monad called Free

    Introduction As Dan Doel points out here, the gadget Free that turns a functor into a monad is itself a kind of monad, though not the usual kind of monad we find in Haskell.

  23. Reinversion Revisited

    Introduction A while back I talked about the idea of reinversion of control using the continuation monad to wrest control back from an interface that only wants to call you, but doesn't want you to call them back.

  24. Distributed computing with alien technology

    Introduction Suppose we are given a function of boolean arguments that returns a boolean result.

  25. What stops us defining Truth?

    Introduction Recall the standard cartoon sketch of the proof of Gödel's first incompleteness theorem.