Can you provide examples? Generally when we say a problem is intractable in CS we are talking about solving it for every instance, not just a particular instance.
For example, the halting problem is "given an arbitrary program, can you determine if it will halt?" I see no reason believe that a human can determine if any arbitrary program will halt. In fact, it's trivial to come up with examples of programs that are so large that there is no way for a human to remotely comprehend what they do, let alone say if it will halt.
So what are these intractable problems that humans can solve with ease?