Back to Questions

Computer Science Fundamentals Algorithms Objective

Nov 23, 2012

It is undecidable, whether

Choose the correct answer:

A) an arbitrary TM has 15 states

B) an arbitrary TM halts after 10 steps

C) an arbitrary TM ever prints a specific letter

D) an arbitrary TM accepts a string w in 5 steps

Detailed Explanation

No Explanation

Discussion (0)

No comments yet. Be the first to share your thoughts!

Share Your Thoughts

Feedback