*How to use watched literals (or, rather, vertices) to do breadth-first search in Horn hyperdigraphs.*

# Theory and Practice

## 26 August 2014

### Watching Horn

## 18 August 2014

## 17 August 2014

### ROSE 1995

Labels:
opinion,
presentation,
random

*What I remember from the first computer-related conference I attended.*

## 07 August 2014

## 30 July 2014

## 24 July 2014

### Depth First Search in Python

Labels:
coding

*Everybody thinks they understand depth-first search.
The algorithm is indeed simple.
But — I think — it is deceptively simple.
In this post I play with some code.
*

## 20 July 2014

### IMO 2014 problem 1

*This is an exercise proposed by Timothy Gowers: Write down all you think of while trying to solve a math problem.*