Discussion
The order of transition functions can be taken from Turing Machine (TM) is
Answer: A
The key's answer is randomly.
A Turing machine's transition function is a set of rules of the form δ(q, a) = (p, b, D). At each step the machine uses the one rule that matches its current state and the symbol under the head; the position of the rule in a written list plays no part. So the transition rules can be listed and taken in any order, which is what the paper means by randomly.
'Sequentially' would mean the rules are applied in the order written, which is not how a Turing machine works, so it and the options built on it are wrong.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development