4 - Theory of Computation Flashcards

You may prefer our related Brainscape-certified flashcards:
1
Q

What does the term algorithm mean?

A

An algorithm is a sequence of steps that can be followed to complete a task and that can be completed in finite time.

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

What does a double circle indicate in a FSA?

A

Accepting state.

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

Explain the functionality of the * metacharacter when it is used in a regular expression.

A

Zero or more of the preceding value.

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

Explain the functionality of the ? metacharacter when it is used in a regular expression.

A

Zero or one of the preceding value.

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

Describe the significance of the Halting problem for commutation.

A

The Halting problem demonstrates that there are some problems that cannot be solved by a computer.

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

What is the question posed by the by the Halting problem?

A

Is it possible in general to write a program that can tell, given any program and its inputs, and without running the program, whether the given program with its given inputs will halt?

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

Why is it not possible to create a Turing machine that solves the Halting problem?

A

The Halting problem is non-computable

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