Final Flashcards
Alan Turing: The turing thesis
- effective or mechanical method in logic and mathematics
- an informal specification of: can be by means of an effective method
- a method or procedure for achieving a desired result is effective just in case
1. it is set out in terms of a finite number of exact instructions
2. it will produce the desired result in a finite # of steps
3. it can be carried out by a human unaided by any machinery
4. it demands no insight or ingenuity on the part of the human to carry it out
Church Turing Thesis
- each provided a formally exact predicate to replace the informal one
- the set contains every mathematical function whose values can be obtained by a method of satisfying the above conditions for effectiveness
Turings predicate
- that of compatibility by Turing Machine
- thesis: whenever there is an effective method for obtaining the values of a mathematical function, the function can be computed by a Turing Machine
- what it is for a task to be computable is to be computable by a turing machine
the turing machine: theory, computability, algorithm
- theory: simple and abstract computational devices intended to help investigate the extent and limitation of what can be computed
- -they are mathematical objects, not physical objects like a physical computer
- computability: it is possible to specify a sequence of instructions which will result in the completion of a task when they are carried out by some machine
- algorithm: set of instructions which will result in the completion of some task
- turing computability: if a task if computable by a turing machine
turing machines: description
- it is a kind of state machine: at any time, the machine is in any of one finite number of states, instructions for the machine consist of specified conditions under which the machine will transition bw one state and another
- it has an infinitely long tape: divided into cells, with each cell containing one symbol: either 1 or 0
- it has a read-writ head: it scans a single cell on the tape during each state and can move left/right
- it performs actions, determined by the following
1. the current state of the machine
2. the symbol in the cell currently being scanned
3. a table of transitions rules - it halts: if the machine reaches a situation in which there is no unique transition rule
- the tape serves as the machines memory
- it shows whether a task or function is computable
a universal turing machine
a turing machine that can compute any function that any turing machine can compute
turings central question
- can machines think?
- what is a machine?
- what is it to think?
-can answer central question by way of the imitation game
the imitation game
- 3 people: a man(A), a woman(B), and an interrogator(C)
- object: for the interrogator to determine which of the other 2 is the man and which is the woman
- the interrogator may ask questions
- answers given in type
- A’s object to trick C
- Bs object to help C
sufficient condition for a machine to think
to be able to fool a human, to be (from the POV of a human interrogator) indistinguishable from any ordinary human in receiving questions and providing answers in the imitation game
the turing test
would you, the interrogator, be able to determine which of the two is a machine and which is a human? if not, the machine counts as thinking aka as capable of having a cognitive state
two questions that arise from the turing test
- is the turing test indeed an adequate test for thinking or cognition?
- can there ever be a machine that can pass the turing test?
turings response to the turing test
- he thinks the test is adequate and that there can/will be machines that can think
- foreshadowed by descartes: he thinks that the turing test is an adequate test for whether a machine can think, but he thinks that no machine could ever pass the test
responses to: can there ever be a machine that can pass the turing test?
- even if some machines can pass the turing test, what would it actually show?
- some argue taht we would grant that machines are capable of thinking in this way, but they would seem to fail to count as having cognition (of understanding, having intelligence, or possessing a mind)
- passing the test is not sufficient for artificial intelligence
putnam: is artificial intelligence possible? Deep Blue
- A chess playing computer that can evaluate 200 million positions/second
- vs Gary Kaspanov (he eventually lost)
- now chess playing computers are widely regarded as being able to beat the strongest players
chess terminator 2010, kramnik
-has an arm
watson by IBM
computer system capable of answering questions posed in naturalized language
- not connected to the internet
- was loaded with 4 terabytes of information
- watson won jeopardy
hillary putnam & Fodor, the computational theory of mind
- what is the nature of the human mind?
- central idea: the human mind if literally a digital computer
- thought/reasoning is literally a kind of computation
- it is a formalizable process that can be duplicated or simulated by the right type of machine
CTM is an example of functionalism
- the basic nature of some things ie mind, thoughts is understood solely in terms of their distinctive causal notes, not the particular stuff they happen to be made of or are realized by (the actual material itself is not essential to the pain)
- ex: we might think that a rational alien is capable of feeling pain, even if it does not have C fibers (human central nervous system)
- we might also think that a rational alien has a mind, even if it does not have a homosapiens physical neurons
computation
- formal symbol manipulation: the manipulation of symbols in the performance of syntactic operations, an algorithm
- something is computational only if it is reducible to an algorithmic solution
- ie symbols (P, water, 1) have syntactic value and a semantic value (meaning)
- example: water
syntactic: symbols arranged in a particular order: w..a….t…e…r
semantic: a word that refers to H2o
a syntactic semantic thesis
- semantic properties are linked to syntactic properties
- the semantic properties of symbols can be encoded in syntactically based rules
- and computation links syntax to causal mechanisms that follow algorithms ie a turing machine
- reasoning processes carry the semantic value of terms and can be carried out through non mysterious physical mechanisms ie a machine without transistors
the human mind
the mind is a computer
-all semantic properties of its mental representations ie beliefs thoughts etc, are tracked by syntactic properties which can be manipulated by the machinery causally responsible for reasoning
problems for CTM
- is all human cognition formalizable?
- how can syntactic considerations justify interpretation?
- are computational processes cognitive?
problem for CTM: Tim maudlin, olympia machine
- we can build a system of buckets that transfer water, implementing a turing machine
- is this system of buckets a thinking thing?
problem for CTM: Ned Block, the Chinese Nation
- suppose everyone in china is given a call list of phone numbers and instructions
- designated input people initiate a process by calling the numbers on their call list
- when others received a call, they would then call the number on their call list and so forth
- the pattern of the calling process can be the same pattern of activation between neurons in a human brain in a mental state, such as pain
- is the entire nation of china thereby in pain?
searles argument on artificial intelligence
such merely computational systems like the olympia machine and chinese nation do not count as genuinely thinking, reasoning, understanding, and cognitive things
-artificial intelligence is not possible
Searles The Chinese Room Argument
- an english speaker who knows no chinese locked in a room full of boxes of chinese symbols together with a book of instructions for manipulating the symbols
- image the people outside the room send in other chinese symbols which are questions, the input
- imagine that by following the instructions in the program the man is able to pass out chinese symbols which are correct answers to the questions, the output
- the program enables the person in the room to pass the turing test for understanding chinese but he does not understand a word of chinese