Searle’s Wall
@article{Blackmon2013SearlesW, title={Searle’s Wall}, author={James C. Blackmon}, journal={Erkenntnis}, year={2013}, volume={78}, pages={109-117} }
In addition to his famous Chinese Room argument, John Searle has posed a more radical problem for views on which minds can be understood as programs. Even his wall, he claims, implements the WordStar program according to the standard definition of implementation because there is some “pattern of molecule movements” that is isomorphic to the formal structure of WordStar. Program implementation, Searle charges, is merely observer-relative and thus not an intrinsic feature of the world. I argue…
5 Citations
The InDeterminacy of Computation
- Philosophy
- 2022
A skeptical worry known as ‘the indeterminacy of computation’ animates much recent philosophical reflection on the computational identity of physical systems. On the one hand, computational…
The determinacy of computation
- PhilosophySynthese
- 2022
A skeptical worry known as ‘the indeterminacy of computation’ animates much recent philosophical reflection on the computational identity of physical systems. On the one hand, computational…
The Intention of Intention
- Philosophy, Computer Science
- 2019
In summary, evolutionary subjectivism modeled as problem solving by computing should save cognitive science, and is proposed to update Kant with Darwin and Turing.
Measurement and Computational Skepticism
- Philosophy
- 2017
Putnam and Searle famously argue against computational theories of mind on the skeptical ground that there is no fact of the matter as to what mathematical function a physical system is computing:…
What propositional structure could not be
- PhilosophySynthese
- 2017
It is argued that the two most promising ways of answering Soames’ Question, the Logical Form Account and the LF Account, are both unsatisfactory and casts doubt on the very idea that propositions are structured.
References
SHOWING 1-10 OF 15 REFERENCES
Why everything doesn't realize every computation
- PhilosophyMinds and Machines
- 2004
It is argued that if one's view of computation involves embeddedness and full causality, one can avoid the universal realizability results and therefore, the fact that a particular system realizes a particular automaton is not a vacuous one, and is often explanatory.
Views into the Chinese Room: New Essays on Searle and Artificial Intelligence
- Philosophy
- 2002
The most famous challenge to the aims of cognitive science and artificial intelligence is the philosopher John Searle's 1980 'Chinese Room' argument. Searle argued that the fact that machines can be…
Representation and Reality
- Philosophy
- 1988
Part 1 Meaning and mentalism: Fodor and Chomsky three reasons why mentalism can't be right connections between 1,2, and 3. Part 2 Meaning, other people and the world: the division of linguistic…
On implementing a computation
- Computer ScienceMinds and Machines
- 2004
An account of implementation, based on the idea that a physical system implements a computation if the causal structure of the system mirrors the formal structure ofThe computation, is developed for the class of combinatorial-state automata but is sufficiently general to cover all other discrete computational formalisms.
Troubles with functionalism
- Psychology, Philosophy
- 1993
One characterization of functionalism that is probably vague enough to be acceptable to most functionalists is: each type of mental state is a state consisting of a disposition to act in certain ways…
On computable numbers, with an application to the Entscheidungsproblem
- Computer ScienceProc. London Math. Soc.
- 1937
This chapter discusses the application of the diagonal process of the universal computing machine, which automates the calculation of circle and circle-free numbers.
Does a rock implement every finite-state automaton?
- Computer ScienceSynthese
- 2004
An account of implementation is developed, linked to an appropriate class of automata, such that the requirement that a system implement a given automaton places a very strong constraint on the system.
What is computation?
- Computer ScienceSynthese
- 2004
The successful drawing of this distinction guards Turing's 1936 analysis of computation against a difficulty that has persistently been raised against it, and undercuts various objections that have been made to the computational theory of mind.