Tag: computability
-
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.
Post Tags
maths combinatorics recursion metric-geometry education admissions web-design turing-machines topology spreadsheets revision ramsey-theory ramsey-numbers quantum-computation modular-machines linear-algebra jekyll group-theory formula finances design derangements computability automata algorithm-theory algebra 
All source code can be found