The document discusses different types of machines and their relative powers to recognize formal languages. Nondeterministic pushdown automata and nondeterministic finite state automata can recognize more languages than their deterministic counterparts. Deterministic Turing machines are more powerful than deterministic finite state automata and can recognize any formal language, but are less powerful than nondeterministic machines.