Cognition and Computation
10 Questions
0 Views

Choose a study mode

Play Quiz
Study Flashcards
Spaced Repetition
Chat to Lesson

Podcast

Play an AI-generated podcast conversation about this lesson

Questions and Answers

Match pairs

Computer Metaphor = 1983, Johnson -Laird Thought as Calculation = 1700-1800, Leibniz Humans were called computers = 1790s, Gaspard de Prony Difference Engine = 1822, Babbage

Match pairs

Alan Turing = The computer is like the mind John von Neumann = The computer is like a brain Newell and Simon = Viewed computers as symbol manipulators (mental chemistry) Alan Turing = Considered the similarity “very superficial”

The ability to manipulate symbols is necessary for intelligent action.

True (A)

Manipulating symbols is not sufficient for intelligent action.

<p>False (B)</p> Signup and view all the answers

The theory of computation is a rich area, and relies on

<p>Universal Turing machine</p> Signup and view all the answers

Two limits of computation

<p>Tractibility and computability</p> Signup and view all the answers

Intractable problems (more than one answer)

<p>require too much time and space (A), time complexity grows as a superpolynomial function (D)</p> Signup and view all the answers

Match pairs

<p>Sorting numbers = time complexity grows as a polynomial function Sorting numbers = computationally tractable The Traveling Salesperson = time complexity is superpolynomia The Traveling Salesperson = computationally intractable.</p> Signup and view all the answers

Match pairs

<p>Sorting letters in alphabetical order = O(n^2) Determine if a string of length n a palindrome. = O(n) Find the shortest tour, where a tour starts and ends at the same location, and visits all n locations. = O(n!) Determine if two character strings of length n are equal. = O(n)</p> Signup and view all the answers

Humans typically solve the problems in time ... in n.

<p>linear</p> Signup and view all the answers

More Like This

Use Quizgecko on...
Browser
Open
Browser
Browser