User blog comment:Mush9/Beyond BIG FOOT (ideas in comments)/@comment-172.58.107.79-20161108023816

Is an uncomputable function like an infinite amount of recursive levels all compacted into 1 function? Is an uncomputable function like a forever function? Let's say for instance, BEAF. BEAF has limits, but an uncomputable function has no limits. Is this true?