More Powerful Models
“We shall not go any further into the nature of this oracle apart from saying that it cannot be a machine”
- These are TMs that can ask an oracle whether a particular string is a member of the oracle’s language
- If the oracle’s language is decidable, the TM gains nothing (except possibly speed)
Computing with real numbers
- More powerful than standard TMs
- Cannot be physically realized