What is the knowledge required to understand the formal definition of a Turing Machine?
All you need is some basic discrete mathematics.

The states, tape alphabet and states are finite sets; the blank symbol, starting state, accepting state and rejecting state are elements of one of those sets.

The transition function is a function on finite sets, defined using a Cartesian product of finite sets.

The tape is a sequence of elements of one of the sets.