Imagine you have a toy called a Turing machine. This toy has a long tape and a movable head that can read and write symbols on the tape. The tape has cells, each of which can hold a symbol, like a 0 or a 1. The Turing machine can do different things depending on what symbol it is currently reading on the tape and what state it is in.
Now imagine you are asked to find the busiest Turing machine possible. This means finding a Turing machine that performs the maximum number of steps before stopping or looping infinitely. This Turing machine is called a "busy beaver". Some people really like busy beavers because they show how powerful Turing machines can be, even though they are just toys.
But wait, why is a busy beaver so special? Doesn't every Turing machine just keep going forever or stop at some point? Well, some Turing machines can actually get stuck in an infinite loop or keep repeating the same thing over and over. Others can keep changing the symbols on the tape so quickly that it becomes impossible to predict what will happen next. A busy beaver is special because it is a Turing machine that keeps doing something different every step of the way and eventually stops after doing an incredibly large number of steps.
It's kind of like a really active little beaver that keeps building and building until it makes his beaver house very very big. And just like the beaver, the busy beaver keeps working and working until it has done everything that it can do. That's why it's called a busy beaver!