Cognition and Computation

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

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”

True

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

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

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

<p>require too much time and space</p> Signup and view all the answers

<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

<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

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