1/9
This selection of flashcards covers foundational concepts and definitions in artificial intelligence as introduced in the lecture.
Artificial Intelligence (AI)
The study of complex information processing problems rooted in biological information processing.
Turing Test
An operational test for intelligent behavior suggesting that by 2000, a machine could fool a human for 5 minutes 30% of the time.
Reinforcement Learning
A type of learning where an agent learns to make decisions by taking actions in an environment to maximize some notion of cumulative reward.
Search Problem
A problem that includes a state space, successor functions, a start state, and a goal test.
Heuristic Function
A function that estimates how close a state is to the goal, designed for a specific search problem.
Uniform Cost Search (UCS)
An algorithm that expands the cheapest node first, ensuring optimality under certain conditions.
Admissible Heuristic
A heuristic that never overestimates the true cost to reach the nearest goal, thus ensuring optimal solutions.
Depth-First Search (DFS)
A search algorithm that expands the deepest node first, typically using a LIFO stack as its fringe.
Breadth-First Search (BFS)
A search algorithm that expands the shallowest node first, typically using a FIFO queue as its fringe.
Multi-Agent Environment
An environment where multiple agents can affect each other's performance, which can be either competitive or benign.