I looked up the busy beaver problem. That's super cool. An uncomputable function constructed that doesn't rely on some sort of diagonalization argument, but instead grows too fast 🤯