Back to marketplace

Critique of computationalism

No description yet. This curated deck is ready for daily study.

Total cards: 24•Content version: v4•Public deck•Updated: 8/1/2026

Card preview (24)

#1
Front (Question)

T2-3-4 indistinguishability

Back (Answer)

The Turing indistinguishability: T4: Symbolic, sensorimotor and neuromolecular indistinguishability T3: Symbolic and sensorimotor indistinguishability T2: Symbolic indistinguishability

#2
Front (Question)

Strong AI

Back (Answer)

Behaves like humans

#3
Front (Question)

Weak AI

Back (Answer)

Has some human like characteristics

#4
Front (Question)

Symbol grounding problem

Back (Answer)

Just manipulating the symbols is not by itself enough to guarantee cognition, perception, understanding, thinking and so forth. Insisting on implementation independence, means that you can only design T2-indistinguishable systems, which will not have intrinsic semantics and thus not reflect cognition, which seems to be about something. To get semantics, you need at least T3-indistinguishability, losing implementation independence

#5
Front (Question)

Chinese room

Back (Answer)

He is a human being in a room and communicating but he does not know what the Chinese symbols mean

#6
Front (Question)

Semantics ≠ syntax

Back (Answer)

Syntax does not give semantics

#7
Front (Question)

Serial processing

Back (Answer)

Everything happens after each other

#8
Front (Question)

Hardware

Back (Answer)

The physical thing

#9
Front (Question)

Software

Back (Answer)

The inner thing

#10
Front (Question)

Searle’s 3 axioms

Back (Answer)

Axiom 1: Computer programs are formal (syntactic) Axiom 2: Human minds have mental contents (semantics) Axiom 3: Syntax by itself is neither constitutive of nor sufficient for semantics

#11
Front (Question)

Searle’s conclusion

Back (Answer)

Programs are neither constitutive of nor sufficient for minds

#12
Front (Question)

Robot argument/reply

Back (Answer)

If the computer program was causally hooked up with the rest of the world, then it would acquire semantics (it would be able to ground symbols by causally interacting with the world) Searles reply: Imagining the Chinese room inside the robot does not add semantics, even if the robot interacts with the world

#13
Front (Question)

Semantics

Back (Answer)

The meaning of a word, phrase, or text.

#14
Front (Question)

Syntax

Back (Answer)

The arrangement of words and phrases to create well-formed sentences in a language. The structure of statements in a computer language.

#15
Front (Question)

Intentionalism

Back (Answer)

Mental states are about something

#16
Front (Question)

Ground (verb)

Back (Answer)

To provide basis for

#17
Front (Question)

The system reply

Back (Answer)

The room understands it Compare with a single (language) neuron relative to the whole brain Searles reply: Saying that the room understands Chinese is analogous to claiming that he (Searle) understands Chinese, if he memorizes all the symbols and all the rules

#18
Front (Question)

The brain simulator reply

Back (Answer)

If the operations of the brain of a Chinese speaker were simulated, such a system would understand Chinese, just like any Chinese speaker does We build something that is very similar to the brain structure- If we can do this there must be understanding Searles reply: (Lau not sure what Searle means) “Computer simulations of brain processes provide models of the formal aspects of these processes. But […] [t]he computational model is no more real than the computational model of any other natural phenomenon”

#19
Front (Question)

Church/Turing Thesis (CTT)

Back (Answer)

All independent attempts to formalize what mathematicians mean by a “computation” or an “effective procedure,” even when they have looked different on the surface, have turned out to be equivalent

#20
Front (Question)

Semantic operations

Back (Answer)

Operations that are based on the meanings of symbols, rather than just their shapes

#21
Front (Question)

Trivial computation

Back (Answer)

Generating uninterpretable symbol systems

#22
Front (Question)

Nontrivial computation

Back (Answer)

The kind that can be made systematic sense of. These are the ones we are interested in

#23
Front (Question)

Weak CTTP

Back (Answer)

Claims that every physical system is formally equivalent to a Turing Machine

#24
Front (Question)

Strong CTTP

Back (Answer)

A plane is a computer It is wrong or uninteresting If every physical process is in fact computation, then the cognitive scientist might as well have ignored the computationist’s message and just kept on hunting for what the right physical process(es) might turn out to be.