Euler #5 solution
3 people like thisPosted: 5 years ago by Michael Falanga
A Turing machine emulator. An infinite tape is simulated by a zipper, instructions are stored in the binary tree for faster lookup.
4 people like thisPosted: 5 years ago by Daniil
Implementation of Langton's ant route.. Takes first 1000 steps and returns only black fields.
3 people like thisPosted: 5 years ago by stejcz
Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English implemented in F#. https://en.wikipedia.org/wiki/Soundex
5 people like thisPosted: 1 years ago by Fabio Galuppo
Implements a bijective mapping between permutations and pairs of standard Young tableaux, both having the same shape. http://en.wikipedia.org/wiki/Robinson%E2%80%93Schensted_correspondence
4 people like thisPosted: 5 years ago by Ademar Gonzalez
Implementation of Langton's ant route.. Takes first 1000 steps and returns only black fields.
1 people like thisPosted: 5 years ago by stejcz
A simple implementation for the sieve of Eratosthenes.
3 people like thisPosted: 5 years ago by Gab_km
An attempt to implement murmurhash version 3 in F# Original source code: https://github.com/aappleby/smhasher/blob/master/src/MurmurHash3.cpp Original author: Austin Appleby Wikpedia link: https://en.wikipedia.org/wiki/MurmurHash
3 people like thisPosted: 3 months ago by MÃ¥rten Lindblad