Description

This mock test of Test: Simulation of Turing Machine for Computer Science Engineering (CSE) helps you for every Computer Science Engineering (CSE) entrance exam.
This contains 10 Multiple Choice Questions for Computer Science Engineering (CSE) Test: Simulation of Turing Machine (mcq) to study with solutions a complete question bank.
The solved questions answers in this Test: Simulation of Turing Machine quiz give you a good mix of easy questions and tough questions. Computer Science Engineering (CSE)
students definitely take this Test: Simulation of Turing Machine exercise for a better result in the exam. You can find other Test: Simulation of Turing Machine extra questions,
long questions & short questions for Computer Science Engineering (CSE) on EduRev as well by searching above.

QUESTION: 1

Fill in the blank with an appropriate option.In automata theory, ___________ is said to be Computationally Universal if can be used to simulate any single taped Turing Machine.

Solution:

Computationally Universal or Turing Complete is a set of data manipulation rules if it can be used to simulate a single-taped turing machine.

QUESTION: 2

Give a classic example of the concept of turing complete.

Solution:

Most of the programming languages, conventional or unconventional are turing complete. Functional languages like Lisp and Haskell are also turing complete.

QUESTION: 3

Let two machines be P and Q. The state in which P can simulate Q and Q can simulate P is called:

Solution:

It is a closely related concept with Turing complete. It says, two computers P and Q are called equivalent if P can simulate Q and Q can simulate P.

QUESTION: 4

Which of the following remarks the given statement?Statement: Any function whose values can be computed by an algorithm, can be computed by a Turing machine.

Solution:

The following conclusion is laid down from the Church-Turing thesis:

Any function whose values can be computed by an algorithm, can be computed by a Turing machine. If any real world computer can be simulated by a turing machine, it is Turing equivalent to a Turing Machine.

QUESTION: 5

Which of the following can be used to simulate any turing machine?

Solution:

The computational aspect of any possible real world computer can be simulated using an Universal Turing Machine so can be any turing machine.

QUESTION: 6

State true or false:Statement: Inorder to show something is Turing complete, it is enough to demonstrate that it can be used to simulate some Turing complete system.

Solution:

es it is. For instance, an imperative language is called Turing complete if it tends to have conditional branching and an ability to maintain an arbitrary number of symbols.

QUESTION: 7

Which of the following can lack in a Universal computer?

Solution:

Real computers which are manufactured till date, all are similar to single taped turing machine. However, they have limited physical resources so they are linearly bounded complete on the contrary.

QUESTION: 8

Which among are not the results of computational theory?

Solution:

All of the following mentioned are the conclusions of automata theory or computability theory.

QUESTION: 9

Which of the games fill under the category of Turing-complete?

Solution:

Many games fall under the category og turing complete:

a) Minecraft

b) Minesweeper

c) Dwarf Fortress

d) Conway’s Game of Life

e) Pokemon Yellow, etc.

QUESTION: 10

Which of the following a Non-turing Complete language?

Solution:

There exists some computational languages which are not turing complete. Regular language which is accepted by finite automata tops the list. Other examples are pixel shader languages embedded in Direct3D and OpenGL extensions.

### Multitape Turing Machine

Video | 17:33 min

### Universal Turing Machine

Video | 08:20 min

### Turing Machine (TM)

Doc | 7 Pages

### Turing Machine Part-2

Doc | 3 Pages

- Test: Simulation of Turing Machine
Test | 10 questions | 10 min

- Test: Turing Machine & Halting
Test | 10 questions | 10 min

- Test: The Language of Turing Machine
Test | 10 questions | 10 min

- Turing Machine: RE, REC & Undecidability - 1
Test | 10 questions | 30 min

- Turing Machine: RE, REC & Undecidability - 2
Test | 15 questions | 45 min