Speaking of slamming the administration (congrats
But instead I reviewed the 8 fundamental truths of the universe, and learned what is possible with an oracle on your side.
- If machine M doesn't decide language L, then L can still be decidable.
- If L is decidable then L is recognizable.
- If L is recognizable, then L isn't necessarily decidable.
- If L is recognizable, then L is enumerable.
- If L is enumerable, then L is recognizable.
- If L is decidable, then L' is recognizable.
- If L and L' are recognizable, then L is decidable (and so is L').
- There is an L that is not recognizable.