Reactive Machine -= AI

Reactive machines are the basic type of AI systems that operate on immediate reactivity – they cannot store memories and past experiences to use in future decisions. 

A reactive machine has a picture of the world at the present moment and makes a decision based on that picture.

Reactive machines have advantages and disadvantages – we cannot expect interaction, emotion, or consciousness from them – but they are reliable in completing tasks because they will react the same way to the same situation every time. Also, they are created for specific purposes and cannot perform duties other than those they are programmed for. Therefore, one can easily trick reactive machines.

Examples of Reactive Machines

An example of a reactive machine is perhaps the most famous AI system – IBM Deep Blue, a chess-playing supercomputer that defeated international grandmaster Garry Kasparov.

Deep Blue understands the rules of chess. He recognizes all the pieces on the chessboard and knows how each of them moves. He can predict the next move for himself and his opponent, and his movements are optimized – by analyzing the current situation on the board, he makes the best one. 

However, Deep Blue has no memory of previous chess games. Everything before the present moment does not exist for him. His decisions are based on the current situation and options.