SLR9 A model of computation

Question 1

Turing machine

Answer 1

“A mathematical model of a hypothetical computing machine which can use a predefined set of rules to determine a result from a set of input variables.”

Question 2

Transition function

Answer 2

“The function that defines the transitions of a state transition system.”

Question 3

State transition diagram

Answer 3

“State diagrams are used to give an abstract description of the behaviour of a system. This behaviour is analysed and represented as a series of events that can occur in one or more possible states. Each diagram usually represents objects of a single class and track the different states of its objects through the system.”

Question 4

Universal Turing machine

Answer 4

“A Turing machine that can simulate an arbitrary Turing machine on arbitrary input. This is achieved by reading both the description of the machine to be simulated as well as the input from its own tape.”

Question 5

“A mathematical model of a hypothetical computing machine which can use a predefined set of rules to determine a result from a set of input variables.”

Answer 5

Turing machine

Question 6

“The function that defines the transitions of a state transition system.”

Answer 6

Transition function

Question 7

“State diagrams are used to give an abstract description of the behaviour of a system. This behaviour is analysed and represented as a series of events that can occur in one or more possible states. Each diagram usually represents objects of a single class and track the different states of its objects through the system.”

Answer 7

State transition diagram

Question 8

“A Turing machine that can simulate an arbitrary Turing machine on arbitrary input. This is achieved by reading both the description of the machine to be simulated as well as the input from its own tape.”

Answer 8

Universal Turing machine