L10 - Register Machine and Cellular Automata Flashcards

1
Q

What is a Register Machine?

A

A machine-like computation model (Machine program)

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

What is the difference between Register Machine and Turing Machine?

A

TM operates by moving left of right on a tape, RM operation is enabled by random access to memory.

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

What is the syntax for resetting, incrementing, decrementing, moving a value in Register Machine?

A

Xi := 0
Xi := Xi + 1
Xi := Xi - 1
Xi := Xj

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

How is a conditional statement performed in RM?

A

if Xi = 0 goto Xj l2 else l7

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

What is the syntax for moving the content of a register addressed by Xj?

A

Xi := <Xj></Xj>

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

What is the syntax for moving into a register addressed by Xi?

A

<Xi> := Xj
</Xi>

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

What is the Store of RM?

A

Memory that is indexed via natural numbers.

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

What is the syntax for the Readin and Readout operations?

A

X0

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

What does Xi represent in RM?

A

A register value

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

Conways Game of Life is Turing Complete. What does this mean?

A

It is a set of data-manipulation rules that can simulate any Turing Machine.

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