This opens up onto philosophical traditions that have mostly been obscured behind modern ideas about us being like computers, but you may want to consider something like Merleau-Ponty's The Phenomenology of Perception (or if you're really strong of heart, Husserl's Crisis of European Sciences and Transcendental Phenomenology).
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?
That is, the undecidability of the halting problem hinges on the need to specify a mechanical/formal process for making the decision, which cannot be done.
Another example: writing new sorting algorithms. Writing a program to do a well defined task.
Approximations. The mind uses approximations - for example, you can use approximate solutions that are fast and computable and still reap 99% of the benefits of a full solution.