# Posts

### Filtered-Space Saving Top-K

Filtered-Space Saving (FSS) is a data structure and algorithm combination useful for accurately estimating the top k most frequent values appearing in a stream while using a constant, minimal memory footprint.

### Gödel’s First Incompleteness Theorem for Programmers

Gödel’s incompleteness theorems are two theorems of mathematical logic that demonstrate the inherent limitations of every formal axiomatic system containing basic arithmetic. These results, published by Kurt Gödel in 1931, are important both in mathematical logic and in the philosophy of mathematics.

### Weighted Random: algorithms for sampling from discrete probability distributions

The optimal solution for weighted random should be the Alias Method. It requires $O(n)$ time to initialize, $O(1)$ time to make a selection, and $O(n)$ memory.

### Illustration of the logistic map

A Python implementation for illustrating the behavior of logistic map.