= Turing machine equivalents
{wiki=Turing_machine_equivalents}
The term "Turing machine equivalent" typically refers to different models of computation that are capable of performing any computation that a Turing machine can do. In other words, two computational models can be considered equivalent if they can simulate each other and can both recognize the same class of problems, such as the recursively enumerable languages. Some common computational models that are considered Turing machine equivalents include: 1. **Lambda Calculus**: This is a formal system for expressing computation based on function abstraction and application.
Back to article page