I wrote a post on my blog detailing how to come up with this solution codual.github.io/2019/07/03/tr

When the fundamental group is non-trivial

Fun exercise: Write a Haskell function update :: Tree a → [a] → Maybe (Tree a), that updates the leaves of a Tree by those given in a list (if there are not enough, return Nothing). My attempt after CW

pop :: Compose (State [a]) Maybe a
pop = Compose $do xs <- get modify' (drop 1) pure (listToMaybe xs) update = evalState . getCompose . go where go (Node _ []) = pure <$> pop
go (Node x ts) = Node x <\$> traverse go ts

Haskell is probably one of the few languages where you have to import a module to use a for loop

Me hice hace un tiempo una lista de ideas para TFG para mates/info y me la he vuelto a encontrar. Como a mí ya no me va a servir, voy a retocarla un momento y cederla al mundo. Si alguien se anima con algo de esto porfa que me escriba que me va a hacer ilusión y tengo bibliografía de casi todo por ahí.

Does anyone have any recommendations on quantum programming languages? Preferably I'm looking for something that both has a simulator and can produce a circuit diagram

"I was quite surprised as well to not find this hierarchy in the literature, so I wrote my graduate thesis about it" cstheory.stackexchange.com/que

You, dumb: there are infinitely many primes.
The GAP System for Computational Discrete Algebra:

*pets a graph with no cycles* what a good boy. good dag.

“Utopia” in Detroit, MI

How do I make base phi a meme?

There are 10 types of people: 1 that is easily understood and the other 0.1 that's completely irrational

My metaheuristics course frustrates me a lot. There's not even a hint at any theoretical basis for any algorithm :( The gist of it seems to be "try random stuff and assume solutions that are close have similar quality"

cursed image

original source for the image (birdsite link)

When the fundamental group is non-trivial

Math puzzle

The friends win if any of them writes down the number on their own forehead. If none of them manage to do so, then the demon wins.

To motivate them we may assume that if the friends win then they all receive a small prize such as cupcakes. Otherwise the demon will keep the cupcakes and the friends will not get any.

Under what circumstances can the friends win?

Math puzzle

I am inspired by a toot of @mx_psi to write down a puzzle I heard last year from a friend.

Three friends are standing around when a demon appears and writes a real number on each one's forehead (they have large foreheads). The demon then invites each of them to write down a finite list of real numbers on a piece of paper. The friends may see each other's foreheads, but must not communicate otherwise. All three simultaneously reveal their papers. (1/2)

I don't quite agree the Axiom of Choice is to be blamed here but it's a cool problem nonetheless

if you can't handle me at my $$\aleph_0$$ then you don't deserve me at my $$2^{\aleph_0}$$

Show older

#### Sparkles (Alola Form)'s choices:

The social network of the future: No ads, no corporate surveillance, ethical design, and decentralization! Own your data with Mastodon!