User blog comment:Qq1010903229/Qq1010903229's Number/@comment-37652882-20191028230505/@comment-37652882-20191028231349

functions of the form "F(n) is the largest number in such and such a program with n charcters" have been done extensively. see Loader's number, the Busy beaver function, and associated articles you'll come across on the topic.

i think what's important more than sheer size is originality and something that grabs us. this personally doesnt grab me because it's just iteration of a function which ive seen many versions of before. but one way you could make this more "grabbing" is to maybe think of a new type of computing - maybe using fluid and variable amounts rather than discrete bits - and then make up a program in that new framework, and make a function based off of that.

i'd love to see what you make, and welcome to the wiki! :)