PHIL1-3 Flashcards

1
Q

What is philosophy

A

Search for conceptual clarity and method of careful and rigorous justification

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What is philosophy of AI

A

Aims to clarify the concept of intelligence (Along with interrelated concepts)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What are descriptive claims

A

What is and what is not. Describing what or how

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What are normative claims

A

Claims about what should and should not be. According to norms

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What is a necessary condition?

A

Everything that is intelligent is P. S is intelligent -> S possesses property P.

Given this, we are able to determine that certain things are not P.
Anything that is not P is not intelligent.. S does not possess P -> S is not intelligent

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What is a sufficient criteria?

A

Everything that is Q is intelligent. S possesses Q -> S is intelligent. We can allow for the possibility that some S may be intelligent whether or not we recognise it.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What are biological criteria and their related concepts?

A

Properties relevant are properties of biological organisms.

Overly restrictive chauvinism: Non biological entities are excluded from the start. Is that justified?

Excessive liberalism: Many organisms possess biological properties, are these intelligent? (Plants)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What is computational criteria?

A

The properties that define certain classes of computational systems. E.g. Turing Machines, PSS etc.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What is a consequence and therefore challenge of computational limitations?

A

Features of intelligence that cannot be replicated by either one or all of those kinds of computational systems like creativity consciousness

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What is the challenge of cognitive scientific uncertainty?

A

We are unsure whether human beings are computational systems, so why suppose any kind of computation is sufficient for intelligence?

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What are behavioral criteria?

A

Relevant properties for the attribution of intelligence are behavioral. S possess an IG test, possesses capacities like walking talking etc.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

What are the different types of criteria? Are they necessary or sufficient?

A

Biological, computational and behavioral. These are sufficient.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What is the Turing Test Criterion?

A

S does well at the Imitiation Game -> S is intelligent

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

What type of criterion is the Turing Test?

A

Behavioral. S needs to behave in a certain way that fools an interrogator. It is sufficient (octopi, preverbal children)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

What is the heads in the sand objection?

A

Instead of an argument against the claim that machines can think: It is an expression of various fears about what might follow if there were thinking machines. (Turing Test)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

What is the argument of various disabilities?

A

Imitation game only considers verbal behavior. Analogous games could be designed for any other behaviors.

17
Q

What is the Total Turing Test and the criterion?

A

It is perhaps not sufficient for S to possess just any of the behavioral capacities but must possess all. S “fools humans in any conceivable context” -> S is intelligent

18
Q

What is Lady Lovelace’s objection?

A

Machines only do what we know how to order them to do. — becomes less compelling as our ability to control and predict the machine’s behavior decreases (ML and NN)

19
Q

What is the threat of pretense?

A

“Can’t something behave as if intelligent without actually being intelligent? Does intelligence depend on capabilities or also how you do it?

20
Q

What defines a PSS implementing a TM ?

A

Finite alphabet of symbols. Finite set of states and table of transition rules from one pairing (symbol,state) to another.

21
Q

What is the relationship between problems and TMs?

A

Every computable problem can be solved by a TM. (Computable = solvable through rule-based manipulation of symbols)

A universal TM can solve all such problems.

All programmable computers that we use today are universal TM’s

22
Q

What is a problem and what makes it interesting?

A

A problem is a transformation of one symbol string to another. Interesting: Can be interpreted by us - can think of them as representing something meaningful. They reflect norms: Rules of mathematics, principles of x..

23
Q

What is the argumentation to say AI is possible?

A

P1. We can design a TM to solve any computable problem
P2. All ‘interesting’ problems are computable
C1. We can design a TM to solve any interesting problem
P3. Being intelligent is the ability to solve interesting problems
C2. We can design a TM that is intelligent
P4. A digital computer can implement any TM
C3. We can build a digital computer that is intelligent —> AI is possible

24
Q

What is a PSS and what does it entail?

A

Implemented TM with interpretable symbols.

Possesses symbols, states and transition rules.
Implemented in some physical system
Can be interpreted with respect to some environment, context or domain (e.g. solves interesting problems)

25
Q

Which one is correct?
1) All TMs are PSSs, but not all PSSs are TM’s
2) All Psss are TMs, but not all TMs are PSSs

A

2

26
Q

State the PSSH

A

A physical symbol system has the necessary and sufficient means for general intelligent action.
Necessary: Any intelligent thing is a PSS
Sufficient: Any PSS is intelligent

  • Newell and Simon
27
Q

What is the PSSH response to the challenge of cognitive scientific uncertainty?

A

Every intelligent organism is a PSS and every intelligent action results from rule-based symbol manipulation

28
Q

How would PSSH describe tasks like decision making?

A

A series of transitions between symbolic states

29
Q

What are the questions typically asked by Symbolic AI researches when designing “intelligent systems”

A

Which symbols should be used to represent the task environment?

Which rules should be deployed to arrive at a particular goal?

How should those symbols and rules be implemented?

30
Q

Explain the Symbolic AI’s Sense -> Think -> Act loop

A

Sense: Transform perceptual stimuli of the physical world into symbol strings. (Objects, Indicators)

Think: Solve the relevant “interesting” problems by applying transition rules. (Calculate/predict/identify)
— Rules may perform heuristic search through a space of possible solutions

Act: Transform symbol strings into physical motion (Steering, braking, accelerating)

REPEAT

31
Q

What is the Frame Problem?

A

It is difficult to distinguish the relevant from the irrelevant problems in any given context — Dennett, 1984