2.4 Reactive Machines
Reactive machines respond to what's in front of them right now. No memory, no learning from the past.
Chapter 2: Types of Artificial Intelligence
Besides "how smart" (narrow/general/super), AI can also be sorted by how it works with memory. The simplest type is the reactive machine.
It looks at the current situation and reacts. That's it. It doesn't remember what happened five minutes ago. The classic example is IBM's Deep Blue, which beat chess world champion Garry Kasparov in 1997 by analysing the board in front of it.
Reactive machines are predictable and reliable, which is great - but they can't adapt or improve from experience.
Key takeaways
Reacts to the present moment only
No memory, no learning from experience
Example: Deep Blue chess computer