# Tag: computability

• ## Modular Machines and their equivalence to Turing Machines

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.