Universal Computation
A model of computation is universal if it can simulate any other model of computation. In other words, it can compute any function that is computable by any means whatsoever.
Link to originalAll reasonable models of computation are equivalent in power. They can all compute exactly the same set of functions - the computables
This includes:
- Turing machines
- lambda calculus
- general recursive functions
- Modern programming languages
- cellular automata (like Rule 110)