User blog comment:Ikosarakt1/Symbols function/@comment-5529393-20121206121247/@comment-5150073-20121214195702

Can we prove representabity of all computable functions? Say, if we take some programming language, and define s(n) as largest output number might be programmed using n bytes, would be there a countable limit ordinal or not? If it is computable, then what is ordinal which measures strength of s(n)?