Comment by hardbass

Certainly, a factoring algorithm is an exact problem. Humans aren't, humans fail variously too. A lookup table won't fail, it would be an exact solution. I am not sure you are talking about computability or trying to think of my example in terms of current memory sizes. In computability, natural numbers of any arbitrary size are manageable and a fixed lookup table upto 2**1000, 2**10000000 or anything you wish is a valid program.