The article discusses how some mathematical systems can't have decision-making machines. It delves into axiomatic systems, which are sets of basic ideas used to prove things. These systems may not always be complete or have machines that make decisions about the ideas. They give examples where these systems may not give all the answers. Even if an axiomatic system is straightforward and consistent, it might not have all the answers. Some systems can't have decision-making machines to tell if a specific idea is true within that system. Overall, the research explores how certain mathematical systems may not be fully predictable or solvable with decision-making machines.