Iago's Blog

How to reformulate a classical discrete unconstrained optimization model into a quantum mechanical system.

How to install Void Linux with LVM over LUKS for full-disk encryption, boot directly from kernel EFI Stub, hibernation, and per-user encryption.

A tutorial on how to wipe, encrypt, auto mount, and decrypt an external usd drive on linux.

Quantum Computers are advancing and one should know how to fit classical problems into them.

Finite automata are awesome but inherently sequential.

Did you know that Finite Automata can recognize divisibility?

Finite automata accept a description using linear algebra that we can translate into a system of tensors or quantum circuits.

A simple ssh workflow for interacting with Jupyter notebooks from your browser while using an HPC supercomputer’s resources.

You may be used to sampling from probabilities, but what about sampling a random finite probability?

Cutting planes are a powerful tool for solving stochastic programs.

From monads to stochastic control and from fixed points to value iteration.

Approximations by cuts are common in convex optimization.

There are many kinds of finite automata.

An exploration of cutting-plane approximations, a technique for representing functions via polyhedra that nicely fits into optimization problems.

A mostly visual post illustrating the graphs for many common kinds of relations.

By doing dynamic programming in an abstract Semiring, we discover that many classical algorithms are, in fact, calculating shortest paths.

By delving into the realm of abstraction, we can uncover practical applications.

Looking at Taylor series as streams of real numbers, solving differential equations becomes as easy as writing them.

From parsing text to controling robots, dynamic programming is everywhere.

What is the difference between automatic and symbolic differentiation?

Writing a symbolic calculator for derivatives may sound like a hard task.

The standard definition of average can be rather opaque.

Ever had to program together with someone via ssh?

All divide-and-conquer algorithms can be separated into a construction part and a merge part.

Most introductions to recursion schemes are aimed at functional programmers.