CH. 9 AI Flashcards
cognitive model
a computational system used to describe information processing aspects of cognition.
turing test
a behavioral test of machine intelligence. If a machine communicating with a human judge via a text interface cannot distinguish it from a human, then the machine passes the test. Some believe that passing the Turing test is an adequate definition of machine intelligence.
weak AI
the view that some machines can behave intelligently.
strong AI
the view that at least some machines that behave intelligently really
are thinking.
symbolic logic
an approach to automated reasoning in which knowledge is
encoded as sequences of symbols called sentences, and new knowledge arises by manipulating and recombining components of sentences according to a set
of formal rules.
predicate calculus
a symbolic logic that supports the representation of general
knowledge about objects, properties, and relationships. Also called first-order
logic.
computability theory
a formal account of computation, providing a means to discriminate between functions that can be computed and those that cannot.
turing machine
an idealized machine equipped with an infinite memory that manipulates symbols in accordance with rules.
algorithm
a finite sequence of formal instructions that can be executed by a
computer.
computational theory of mind
the idea that the mind is a computational
system that converts sensory inputs into symbols and process these symbols in
accordance with rules in order to produce behavior
symbolic systems/symbolic AI
an approach to AI that focuses on formal
rules applied to explicit symbol structures. This is the most popular computational
theory of mind and is closely related to the representational theory of mind. Associated with the view that the mind is to the brain as software is to hardware
physical symbol system hypothesis
the claim that the ability of a machine to
manipulate symbolic structures is foundational for general intelligence. “A physical symbol system has the necessary and sufficient means for general intelligent
action” (Newell & Simon, 1976).
sentential knowledge representation
an approach to knowledge representation inspired by sentences in natural languages. Propositions are represented as
sequences of symbols. Symbolic logic uses sentential knowledge representations.
compositional knowledge representation
an approach to knowledge representation in which the meaning of a complex representation is a simple function
of the meanings of its parts.
sound
a property of an automated reasoning system that guarantees that any
proposition inferred by the system is justified by the system’s body of knowledge.
complete
a property of an automated reasoning system that guarantees that any proposition that is justified by a body of knowledge can be inferred by the
system when given that knowledge.
locality
a property of automated reasoning systems using symbolic logic that
allows individual conclusions to be reached with certainty using only a small
amount of relevant knowledge.
detachment
a property of automated reasoning systems using symbolic logic
that allows the justifications for conclusions to be discarded once the conclusions
are determined to be true
truth-functionality
a property of automated reasoning systems using symbolic
logic that makes the meaning of a complex sentence a simple function of the
meanings of the components of the sentence.
bounded rationality
automated reasoning that takes into account limitations on
computational resources such as memory and processing time