1. A Universal Turing Machine can compute anything that any other Turing Machine could possibly compute.
True
2.The Turing Test is a test of whether a problem can be solved by a Turing Machine.
True
3. Every acceptable language is also decidable.
False
4. Decidability is a special case of decidability
True
5. Regular languages are decidable
True
6. Context free languages are not decidable
False
No comments:
Post a Comment