R7 Questions Flashcards

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

Turing’s B-unorganized machine consists of two things:

A
  1. artificial neurons

2. devices that alter connections between those neurons

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

Connection modifiers can be in two modes:

A
  1. “pass mode”: where an input (zero or one) can pass through unaltered and turn into an output
  2. “interrupt mode”: where an output is always one, regardless of what the input is
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Every neuron in the network executes this logical operation

A

NAND (“not and”)

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

Why did Turing choose this logical operation?

A

NAND operator can replicate all other Boolean operators.

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

Turing’s machine employs _____ of connections in training

A

the destruction & creation

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

Give 1 example of a task that has been called “uncomputable”.

A

A universal Turing machine couldn’t be able to tell the difference between arithmetical theorems (7 + 5 = 12) and nontheorems.

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

Turing and Church’s claims for the universal Turing machine have been commonly misstated. State them correctly.

A

Church and Turing’s claims didn’t exclude the possibility of hypermachines. They only stated that a universal Turing machine could mimic the behavior of a human mathematician that was working with paper and pencil.

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