Turing Machines Flashcards

1
Q

What is a Turing Machine?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What is the blank symbol?

For a Turing Machine

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What is a partial function?

Turing Machine

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What is the notation of a deterministic Turing machine?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What is the configuration of a Turing machine?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What are the computation steps of a Turing machine? What is a halting state?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What does an arrow mean when going from one state to another in a Turing machine?

Update this question if it does not make sense.

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

When is a language accepted by a Turing machine? How is it then called?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Name two extensions to Turing machines.

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What is the Church-Turing thesis?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What is a universal Turing machine?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Proof that not all languages are recusively enumerable.

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly