Facebook Pixel Code
We use cookies to create the best experience for you. Keep on browsing if you are OK with that, or find out how to manage cookies.

Copeland's Narrow versus Wide Mechanism and Simon's Bounded Rationality in Social Science

This is a preview of the 9-page document
Read full text

Narrow mechanists believe that the human mind can be computed and scientifically explained much like Turing machines, and that idea is due to the beliefs that:   - all functions that can be generated by machines (those that work on finite input in accordance with a finite program of instructions) are Turing-machine-computable and  - any process that can be given a systematic mathematical description (a precise characterization of a set of steps, or that which is scientifically describable or explainable) can be simulated by a Turing machine. In line with such beliefs, artificial intelligence can thus be simulated by creating a system that consists of physical symbols within a storage system with a large yet finitely-possible capacity, thus asserting the idea that the mind can be simulated by a Turing machine.

Such ideas make Turing seem that he firmly believes in the programmed and readily-simulated state of the human mind. It must be noted, however, that in Turing’ s time he was referring to computers as humans that were doing computations for industries or whatever body entails their computing services. This resulted in misleading ideas that started from Turing’ s original thesis that the universal computing machine is able to do multiple jobs that human computers are capable of doing.

He states the importance of the universal computing machine by having a single one that is able to do multitudes of tasks, much like humans, and programming the machine to do different jobs also means that a machine does not need to be limited with doing just one thing (Copeland, 2000, p. 27). In this case, it can be inferred that Turing’ s thesis explains that the human mind is a partially random machine, or a machine under a discrete-state, with finite lookup tables or flowcharts instead of singular programs or functions.

Such machines are digital in nature, and that the function of the machine is enhanced by an infinite storage capacity, which explains why such a machine is different from a Turing machine.

This is a preview of the 9-page document
Open full text
Close ✕
Tracy Smith Editor&Proofreader
Expert in: Social science, Politics, History
Hire an Editor
Matt Hamilton Writer
Expert in: Social science, Culture, Law
Hire a Writer
preview essay on Copeland's Narrow versus Wide Mechanism and Simon's Bounded Rationality in Social Science
WE CAN HELP TO FIND AN ESSAYDidn't find an essay?

Please type your essay title, choose your document type, enter your email and we send you essay samples

Contact Us