Tag: recursion

  • Modular machines and their equivalence to Turing machines

    First published June 18, 2019

    Modular machines are a lesser-known class of automata, which act upon \(\mathbb{N}^2\) and are actually capable of simulating any Turing Machine - a fact which we will prove here.

  • Counting derangements

    First published April 21, 2019

    I present an inefficient yet novel way of recursively counting derangements of a set, and generalise this to counting permutations without short cycles.

Subscribe to updates.
All source code can be found here.
Built with Jekyll, hosted by GitHub Pages.
Copyright © 2024 Joseph MacManus.