How is the correspondence problem undecidable?

An undecidable problem is a problem that can not have any algorithm to solve it.

A matching problem can be solved using a brute force approach. So, how can it be an undecidable problem?