6Computable Languages
The University of Melbourne
After considering the restricted computational models of finite and pushdown automata, we are now ready to study the power and limits of general computation using the model of Turing machines.
After considering the restricted computational models of finite and pushdown automata, we are now ready to study the power and limits of general computation using the model of Turing machines.