Super-Turing computation is any form of computation that cannot be performed by a finite Turing machine.
This includes, but is not limited to:
- Solving problems that can be solved on a Turing machine, in a lower time complexity class than they can be solved in on a Turing machine.
- Solving an uncountable number of problems simultaneously.
- Working with irrational numbers with the same efficiency that a finite Turing machine works with rational numbers.
- Pulse computers
- Analog computers
- Quantum computers