COGNITIVE SCIENCE REVISION QUESTIONS. ALL EXAM
REVISION QUESTIONS AND CORRECT ANSWERS
(ALREADY GRADED A+) (2024 UPDATE) 100% GUARANTEED
SUCCESS.
Church-Turing Thesis (not theorem) - ANSWER- The class of computable functions and the
class of functions that can be computed by a Turing machine are one and the same
Adding "extra features" increases the power of a Turing machine (T/F) - ANSWER- False.
Nothing adds any power
Every algorithm discovered so far has run on a Turing machine (T/F) - ANSWER- True.
Mind is like a desktop computer (T/F) - ANSWER- False. Computation is an activity. Desktop
computer is a device. Not saying minds have the structure of a specific device.
Computer provides an excellent metaphor for the mind (T/F) - ANSWER- False. CTM doesn't
say what minds do is LIKE computation, it is computation.
CTM says "computers can be used to simulate what minds do" (T/F) - ANSWER- False. Even
if true, CTM does not say that.
Is every conceivable function computable? Yes or no? - ANSWER- Nope. There are some
random functions that cannot be summarized by means of a finite procedure.
"Reductio ad Absurdum" argument - ANSWER- Some functions "seem" as if they should be
well-behaved but are in fact not well-behaved
, An algorithm is always finitely specified (T/F) - ANSWER- True. Steps of an algorithm are
simple and mechanical
The function can be defined over an infinite domain (T/F) - ANSWER- True
Multiple Realizability of Mental States - ANSWER- Mental states or processes are multiply
realizable. Any mental state or process can be implemented in multiple different physical
substrates.
The Turing Test for Intelligence - ANSWER- 1. The human behind the screen is intelligent
2. The computer is (more or less) input-output equivalent to the human (since a competent judge
can't tell the difference betweent he two)
Thus...
3. The computer is intelligent
Associationistic Account of Language - ANSWER- A bunch of associations typically between
verbal behaviors and rewards
(Chomskian) Cognitive Account of Language - ANSWER- Abstract combinatoric rules. Most
of it is innate it is part of "Universal Grammar"
Consequentialist View: Rationality - ANSWER- Doing those things that achieve the best
outcomes (the outcomes that you yourself regard as most desirable)
EU Algorithm - ANSWER- 1. Calculate the expected utility of each action
2. Choose action that has the highest expected utility
REVISION QUESTIONS AND CORRECT ANSWERS
(ALREADY GRADED A+) (2024 UPDATE) 100% GUARANTEED
SUCCESS.
Church-Turing Thesis (not theorem) - ANSWER- The class of computable functions and the
class of functions that can be computed by a Turing machine are one and the same
Adding "extra features" increases the power of a Turing machine (T/F) - ANSWER- False.
Nothing adds any power
Every algorithm discovered so far has run on a Turing machine (T/F) - ANSWER- True.
Mind is like a desktop computer (T/F) - ANSWER- False. Computation is an activity. Desktop
computer is a device. Not saying minds have the structure of a specific device.
Computer provides an excellent metaphor for the mind (T/F) - ANSWER- False. CTM doesn't
say what minds do is LIKE computation, it is computation.
CTM says "computers can be used to simulate what minds do" (T/F) - ANSWER- False. Even
if true, CTM does not say that.
Is every conceivable function computable? Yes or no? - ANSWER- Nope. There are some
random functions that cannot be summarized by means of a finite procedure.
"Reductio ad Absurdum" argument - ANSWER- Some functions "seem" as if they should be
well-behaved but are in fact not well-behaved
, An algorithm is always finitely specified (T/F) - ANSWER- True. Steps of an algorithm are
simple and mechanical
The function can be defined over an infinite domain (T/F) - ANSWER- True
Multiple Realizability of Mental States - ANSWER- Mental states or processes are multiply
realizable. Any mental state or process can be implemented in multiple different physical
substrates.
The Turing Test for Intelligence - ANSWER- 1. The human behind the screen is intelligent
2. The computer is (more or less) input-output equivalent to the human (since a competent judge
can't tell the difference betweent he two)
Thus...
3. The computer is intelligent
Associationistic Account of Language - ANSWER- A bunch of associations typically between
verbal behaviors and rewards
(Chomskian) Cognitive Account of Language - ANSWER- Abstract combinatoric rules. Most
of it is innate it is part of "Universal Grammar"
Consequentialist View: Rationality - ANSWER- Doing those things that achieve the best
outcomes (the outcomes that you yourself regard as most desirable)
EU Algorithm - ANSWER- 1. Calculate the expected utility of each action
2. Choose action that has the highest expected utility
