User blog comment:LittlePeng9/First order oodle theory/@comment-172.58.107.230-20161109215955

So the difference between uncomputable functions and formal language is that formal languages uses symbols to described uncomputable functions. Like first order set theory uses symbols to described the Busy Beaver function. So therefore formal language is more powerful than uncomputable functions and can go beyond uncomputable functions. Is all of this true?