100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached
logo-home
COGNITIVE SCIENCE REVISION QUESTIONS. ALL EXAM REVISION QUESTIONS AND CORRECT ANSWERS (ALREADY GRADED A+) (2024 UPDATE) 100% GUARANTEED SUCCESS. $8.99   Add to cart

Exam (elaborations)

COGNITIVE SCIENCE REVISION QUESTIONS. ALL EXAM REVISION QUESTIONS AND CORRECT ANSWERS (ALREADY GRADED A+) (2024 UPDATE) 100% GUARANTEED SUCCESS.

 2 views  0 purchase
  • Course
  • Cognitive Psychology
  • Institution
  • Cognitive Psychology

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 d...

[Show more]

Preview 2 out of 9  pages

  • November 1, 2024
  • 9
  • 2024/2025
  • Exam (elaborations)
  • Questions & answers
  • Cognitive Psychology
  • Cognitive Psychology
avatar-seller
pharismusyoka99
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

The benefits of buying summaries with Stuvia:

Guaranteed quality through customer reviews

Guaranteed quality through customer reviews

Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.

Quick and easy check-out

Quick and easy check-out

You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.

Focus on what matters

Focus on what matters

Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!

Frequently asked questions

What do I get when I buy this document?

You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.

Satisfaction guarantee: how does it work?

Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.

Who am I buying these notes from?

Stuvia is a marketplace, so you are not buying this document from us, but from seller pharismusyoka99. Stuvia facilitates payment to the seller.

Will I be stuck with a subscription?

No, you only buy these notes for $8.99. You're not tied to anything after your purchase.

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

75632 documents were sold in the last 30 days

Founded in 2010, the go-to place to buy study notes for 14 years now

Start selling
$8.99
  • (0)
  Add to cart